Method and apparatus for a DMT receiver having a data de-formatter coupled directly to a constellation decoder

ABSTRACT

In a communication system that utilizes DMT technology to couple a primary site (102) to a plurality of secondary sites (104-108), the primary site (102) and each of the secondary sites (104-108) includes a DMT receiver. Such a DMT receiver includes a discrete multi-tone decoder that receives a time domain discrete multi-tone symbol and produces an ordered data stream based on bit loading information and a data de-formatter, operably coupled to the discrete multi-tone decoder, wherein the data de-formatter receives the ordered data stream and produces a recovered data stream based on carrier channel allocation information.

FIELD OF THE INVENTION

This invention relates generally to communication systems and moreparticularly to a communication system infrastructure.

BACKGROUND OF THE INVENTION

The term "communication system" covers a variety of networks, devices,and systems that provide communication between a plurality of nodes. Onesuch communication system is a two-way wireless communication system asshown in FIG. 1. The two-way wireless communication system 10 includes asystem controller 12, a switch 14, a plurality of base stations 16-20, aplurality of communication resources 22-26, and a plurality ofcommunication units 28-32. The plurality of base stations 16-20 arecoupled to the switch 14 via wireline links 34-38. These wireline links34-38 are typically T1 links which have a bandwidth of approximately 1.5megahertz and a capacity of 1.5 Mbps (mega-bits per second).

In operation, a communication unit transmits an inbound signaling (ISW)via a wireless communication resource 22-26, which has been designatedas a control channel. One of the base stations 16-20 receives the ISWand transmits it via the T1 link 34-38 to the switch 14. The switchprovides the information to the system controller 12 which determinesthe validity of the request. For a valid request, the system controllergrants the requested service, which may be a two-way wirelesscommunication, a group call, a private call, or a telephone interface.Note that the communication units 28-32 may be any type of two-waywireless communication device, such as a mobile radio, a portable radio,a cellular telephone, or a cellular/mobile/portable radio telephone.

Having granted the request, the system controller 12 allocates awireless communication resource 22-26 to the requesting communicationunit. This information is sent out via the switch 14, one of the T1links 34-38, and a base station 16-20. With the allocation of a wirelesscommunication resource, the requesting communication unit may performits wireless, or RF (Radio Frequency), communication.

While the two-way wireless communication system 10 of FIG. 1 provides avariety of services to a communication unit, or subscriber unit, theinfrastructure requires high bandwidth wireline transmission linksbetween the switch 14 and the base stations 16-20. As shown, these highbandwidth transmission links are typically T1 links which providestransmission capabilities of 1.5 Mbps. Alternatively, the links could bemicrowave links that provide an equivalent bandwidth as the T1 links.

Regardless of the type of link used, it must have a large bandwidth toconvey large amounts of information between a base station and theswitch. Because of the large amounts of information being conveyed, lowfrequency transmission lines, such as twisted pair copper telephonelines, cannot be used for these interconnections. Typically, a twistedpair copper wire telephone line has a bandwidth of 4 kilohertz. Intwo-way wireless communication systems, the intercoupling between theswitch and base stations requires at least a 20 kilohertz bandwidth fora single data transfer. If multiple data transfers are occurringsimultaneously, which is the typical case, the bandwidth requirementsincrease accordingly. Thus, based on these bandwidth requirements, thetwisted pair copper telephone line does not provide adequate bandwidth.

Another type of communication system is illustrated in FIG. 2 as aone-way wireless communication system 40. The one-way wireless system40, which may be a paging system, includes a system controller 42, aswitch 44, wireline links 46-50, a plurality of transmitters 52-56, aplurality of communication resources 58-62, and a plurality ofcommunication units 64-68 or pagers. In operation, the system controllerreceives a request to transmit a page to at least one of the pluralityof communication units 64-68. Upon receiving this request, the systemcontroller 42 generates a paging message which is transmitted to theswitch 44 and subsequently routed via one of the wireline links 46-50 tothe appropriate transmitter. Upon receiving the paging message, thetransmitter transmits the message to the paging unit via one of the RFcommunication resources.

As with the two wire two-way wireless communication system 10 of FIG. 1,the one way wireless system 40 requires a high bandwidth wireline linkbetween the switch and the transmitters. Thus, a twisted pair coppertelephone line, which has a bandwidth of approximately 4 kilohertz, willnot provide the needed transmission capacity of the one-way wirelesscommunication system 40.

The two-way wireless system 10 and the one-way wireless system 40 eachprovide the communication unit with unique features. These uniquefeatures center around the fact that these wireless systems can transmitone communication to a plurality of receiving units. In other words,such wireless systems support one-to-many communications and/ormany-to-one communications.

To enhance the transmit capabilities of a twisted pair copper telephoneline, several techniques have been developed. For example IntegratedServices Digital Network (ISDN) extends the bandwidth of a twisted paircopper telephone line from 4 kilohertz up to 200 kilohertz, whichprovides a transmission capability of 160 Kbps. Motorola part numbersMC145474, and MC145472 provide ISDN services. While these devicesincrease the bandwidth of a twisted pair telephone line, they areintended for one-to-one telephone communications. For example, the ISDNchips may be used for video telephone conferencing, facsimiletransmissions, and pair gain transmissions, where pair gain transmissionis a multiplexing technique of several telephone calls on a single line.

Another technique which increases the transmission capabilities of atwisted pair copper telephone line is Asymmetrical Digital SubscriberLoop, or Link, (ADSL). An ADSL device increases the bandwidth of thetwisted pair telephone line up to 1.1 megahertz, which providestransmission capabilities up to 9 Mbps. Similar to the ISDN technique,the ADSL technique is used for one-to-one communications and providesadditional bandwidth over the ISDN devices.

FIG. 3 illustrates a typical ADSL two wire system. The ADSL two wiresystem 70 includes a video server 72, which may be a camera, anasynchronous transfer mode (ATM) switch 74, an ADSL transceiver 76, asplitter 78, a plain old telephone service (POTS) 80, a twisted paircopper wire telephone line 82, a second splitter 84, a telephone 86, asecond ADSL transceiver 88, and a television monitor 90. In general, thefirst and second ADSL transceivers 76 and 88 communicate to establish aspectral response of the telephone line 82. Having exchanged thisinformation, a transmission can begin. In operation the video camera 72will receive an image for teleconferencing and convert that image intodigital information. The camera 72 routes the digital information to theATM switch 74, which, in turn, routes the digital information to theADSL transceiver 76. The ADSL transceiver converts the digitalinformation into a Discrete Multi-Tone (DMT) symbol and conveys the DMTsymbol to the other ADSL transceiver via the splitters 78, 84 and thetelephone line 82. Upon receiving the DMT symbol, the second ADSLtransceiver 88 recaptures the digital information and routes the digitalinformation to the TV monitor 90.

In addition to transmitting high bandwidth digital information, the ADSLtwo wire system 70 can also support regular telephone communications orPOTS. This is done via the splitters 78 and 84 which route low frequencyor POTS signals to the telephone 86 or the POTS switch 80 while routingthe higher frequency signals to the ADSL transceivers.

FIG. 4 illustrates a frequency spectrum of carrier channels used in anADSL system. The low frequency range, 0-4 kilohertz, is reserved forplain old telephone system (POTS) transmissions. The high frequencyrange, from 25 kilohertz to 1.1 megahertz, is used for ADSLtransmissions. With this defined separation, the splitters 78, 84 ofFIG. 3 can easily separate the low frequency signals from the highfrequency signals.

The high frequency range of FIG. 4 is divided into 256 carrier channelsseparated by approximately 4 kilohertz. The first 32 carrier channels inthe range from 0 kilohertz to 138 kilohertz are full duplex channelswhile the 224 channels in the frequency range from 138 kilohertz to 1.1megahertz are half duplex channels. For the 32 carrier channels in thefull duplex range, echo cancellation must be incorporated in thesplitters to ensure proper reception and transmission of the signals.

Each carrier channels can support up to 15 bits of QAM information. Theactual amount of bits a carrier channel supports varies, however, due tothe spectral response of the telephone line. For example, one carrierchannel may be able to accommodate 15 bits while another may be onlyable to accommodate 4 bits. Due to ADSL requirements the minimum amountof bits a carrier channel can support, referred to as bit loading, is 2bits and still carry data.

To determine the spectral response of the telephone line, the ADSLtransceivers use an algorithm as shown in FIG. 5. As shown, a first ADSLtransceivers will transmit a wide band test signal to a second ADSLtransceiver. Upon receipt, the second ADSL transceiver evaluates thereceived signal to determine the spectral response of the telephoneline. Having the spectral response, the second ADSL generates a bitloading table and sends the bit loading table to the first ADSLtransceiver. The bit loading table includes, for each carrier channel, anumber of bits that the carrier channel can support.

FIG. 6 illustrates the transmit portion of the ADSL transceiver. Asshown, the ADSL transmitter includes a multiplexer which receives aplurality of inputs via T1 links, ADSL control, an ISDN connection, andan HO link. Based on the ADSL control, the multiplexer provides one ofthe inputs to a constellation encoder via a fast path or an interleavepath. The fast path includes a scramble cyclic redundancy check (CRC)block which is coupled to a forward error correction (FEC) block. Theinterleave path includes a scramble CRC, a forward error correctionblock, and an interleave block. The path selected depends on the levelof burst error correction needed. If less error correction is needed,the fast path is selected, otherwise the interleave path is selected.

The constellation encoder encodes the received signals based on the bitloading table and an encoding sequence to produce an encoded datastream. The encoded data stream is then provided to the DiscreteMulti-Tone (DMT) modulator which produces a DMT symbol from the encodeddata stream. The DMT symbol is then transmitted to the receiver of theother ADSL transceiver via the telephone line.

FIG. 7 illustrates the receiver portion of the ADSL transceiver. Asshown, the ADSL receiver includes a DMT demodulator which demodulatesthe DMT symbol to produce a demodulated signal. The demodulated signalis then provided to the constellation decoder which decodes the signalbased on the bit loading information and a decoding sequence torecapture the transmitted data stream. The recaptured data stream isthen provided to the demultiplexer via a fast path or deinterleave path.The de-multiplexer then provides recaptured data to the appropriateoutput line.

While the ADSL system increases the bandwidth of a telephone line, up to1.1 megahertz, it is designed for one-to-one communications and notone-to-many or many-to-one communications. Therefore, a need exists fora one-to-many and/or many-to-one communication system infrastructurethat utilizes existing telephone lines while providing the highlyreliable service subscribers of wireless communication systems expect.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a prior art two-way communication system;

FIG. 2 illustrates a prior art one-way wireless communication system;

FIG. 3 illustrates a prior art ADSL two wire communication system;

FIG. 4 illustrates a prior art representation of an ADSL frequencyspectrum allocation;

FIG. 5 illustrates a prior art flow diagram for determination of bitloading information of a telephone line;

FIG. 6 illustrates a prior art schematic block of ADSL transmitter;

FIG. 7 illustrates a prior art schematic block diagram of ADSL receiver;

FIG. 8 illustrates a communication system in accordance with the presentinvention;

FIG. 9 illustrates a two-wire communication system in accordance withthe present invention;

FIG. 10 illustrates a schematic block diagram of a primary site inaccordance with the present invention;

FIG. 11 illustrates a secondary site in accordance with the presentinvention;

FIG. 12 illustrates a logic diagram for the overall operation of aprimary site in accordance with the present invention;

FIG. 13 illustrates a flow diagram for an overall operation of asecondary site in accordance with the present invention;

FIG. 14 illustrates a logic diagram for obtaining bit loadinginformation in accordance with the present invention;

FIG. 15 illustrates an exemplary process for obtaining bit loadinginformation in accordance with the present invention;

FIG. 16 illustrates a logic diagram for determining an outbound controlchannel for the system of FIG. 8 in accordance with the presentinvention:

FIG. 17 illustrates an exemplary process for determining an outboundcontrol channel in accordance with the present invention;

FIG. 18 illustrates a logic diagram for updating the outbound controlchannel in accordance with the present invention;

FIG. 19 illustrates a logic diagram for determining an inbound controlchannel for the system of FIG. 8 in accordance with the presentinvention;

FIG. 20 illustrates an exemplary allocation and utilization of aninbound control channel in accordance with the present invention;

FIG. 21 illustrates an alternative exemplary allocation and utilizationof an inbound control channel in accordance with the present invention;

FIG. 22 illustrates a logic diagram for updating the inbound controlchannel in accordance with the present invention;

FIG. 23 illustrates a logic diagram for establishing an infrastructurefor a call in accordance with the present invention;

FIG. 24 illustrates an alternative logic diagram for establishing a callin the system of FIG. 8 or FIG. 9 in accordance with the presentinvention;

FIG. 25 illustrates another alternative embodiment for establishing acall within the system of FIG. 8 or FIG. 9 in accordance with thepresent invention;

FIG. 26 illustrates a logic diagram that may be used to implementcarrier channel allocations in accordance with the present invention;

FIG. 27 illustrates an alternate logic diagram that may be used toimplement carrier channel allocations in accordance with the presentinvention;

FIG. 28 illustrates a logic diagram that may be used to generate anordered bit loading table in accordance with the present invention;

FIG. 29 illustrates another alternate logic diagram that may be used toimplement carrier channel allocations in accordance with the presentinvention;

FIG. 30 illustrates a logic diagram that may be used to update carrierchannel assignments in accordance with the present invention;

FIG. 31 illustrates a logic diagram that may be used to update bitloading tables in accordance with the present invention;

FIG. 32 illustrates an alternate logic diagram that may be used toupdate carrier channel assignments in accordance with the presentinvention;

FIG. 33 illustrates a logic diagram that may be used to update carrierchannel assignments for a control channel in accordance with the presentinvention;

FIG. 34 illustrates a functional block diagram of a DMT transmitter inaccordance with the present invention;

FIG. 35 illustrates a schematic block diagram of a data formatter of theDMT transmitter in accordance with the present invention;

FIG. 36 illustrates a schematic block diagram of an ADSL transmittercoupled to a data formatter in accordance with the present invention;

FIG. 37 illustrates a schematic block diagram of an ADSL data interfacecoupled to an ADSL transmitter in accordance with the present invention:

FIG. 38 illustrates a logic diagram that may be used to implement a DMTtransmitter in accordance with the present invention;

FIG. 39 illustrates an alternative logic diagram that may be used toimplement a DMT transmitter in accordance with the present invention;

FIG. 40 illustrates a functional block diagram of a DMT receiver inaccordance with the present invention;

FIG. 41 illustrates a schematic block diagram of a data de-formatter ofthe DMT receiver in accordance with the present invention;

FIG. 42 illustrates a schematic block diagram of an ADSL receivercoupled to a data de-formatter in accordance with the present invention;

FIG. 43 illustrates a schematic block diagram of an ADSL data interfacecoupled to an ADSL receiver in accordance with the present invention;

FIG. 44 illustrates a logic diagram that may be used to implement a DMTreceiver in accordance with the present invention;

FIG. 45 illustrates an alternative logic diagram that may be used toimplement a DMT receiver in accordance with the present invention;

FIG. 46 illustrates a logic diagram that may be used to generateaddresses for the data formatter and/or the data de-formatter inaccordance with the present invention;

FIG. 47 illustrates an alternative logic diagram that may be used togenerate addresses for the data formatter and/or the data de-formatterin accordance with the present invention;

FIG. 48 illustrates a logic diagram that may be used to generate addresspointer information for the data formatter and/or the data de-formatterin accordance with the present invention;

FIG. 49 illustrates another alternative logic diagram that may be usedto generate addresses for the data formatter and/or the datade-formatter in accordance with the present invention;

FIG. 50 illustrates an alternative logic diagram that may be used togenerate address pointer information for the data formatter and/or thedata de-formatter in accordance with the present invention;

FIG. 51 illustrates an example of a DMT symbol formation in accordancewith the present invention;

FIG. 52 illustrates database information stored in memory in accordancewith the present invention;

FIGS. 53-61 illustrate an example of carrier channel allocation inaccordance with the present invention; and

FIG. 62 illustrates a data flow diagram in accordance with the presentinvention.

DETAILED DESCRIPTION OF THE DRAWINGS

Generally, the present invention provides a method and apparatus forestablishing a communication system infrastructure utilizing a low passtransmission path, i.e. twisted pair telephone line. This may beaccomplished by providing a primary site which includes a controller, adata multiplexing switch, a DMT transmitter and a DMT receiver. Theprimary site is coupled to a plurality of secondary sites via low passtransmission paths. Each of the secondary site includes a secondary DMTreceiver, a secondary DMT transmitter, a secondary DMT data multiplexingswitch, a site controller and at least one subscriber interface.

The primary site communicates with the plurality of secondary sites viainbound and outbound low pass transmission paths. This is done via therespective DMT receivers and DMT transmitters, wherein the DMTtransmitter transmits information over a plurality of carrier channelsto a targeted DMT receiver. The information transmitted may be controlinformation, i.e., the co-ordination information used by the primarysite and the secondary sites to establish data transfers, or userinformation, i.e., the information intended for a subscriber of thecommunication system. To convey this information, the DMT transmitterformats the user information and then converts it into DMT symbols,which is the actual information transmitted over the low passtransmission path. The DMT receiver receives the DMT symbols, deformatsit to recapture the original information.

Before any information can be transmitted, an inbound control channeland an outbound control channel must be established over the low passtransmission paths. The inbound and outbound control channelsestablished on the low pass transmission path are different than thecontrol channels established in an RF communication system. The controlchannels of the RF communication system are used to convey communicationsystem operational information to the subscribers of the system. Forexample, a request for a call, RF communication resource allocation,request deny, status inquiries and responses are all forms ofcommunication system operational information that are transmitted overthe RF control channels. The control channels established on the lowpass transmission paths are used to convey system infrastructureinformation between the primary site and the secondary sites and toroute the communication system operational information to the sites suchthat the operational information may be subsequently transmitted to thesubscribers.

The outbound control channel for the system infrastructure is generallyestablished when the primary site transmits a training signal to each ofthe plurality of secondary sites. Upon receiving the training signal,each of the secondary sites performs a spectral response analysis of theoutbound low pass transmission path based on the training signal andthen creates bit loading information. In a sequential order, the primarysite requests and stores the bit loading information from each of thesecondary sites, wherein the bit loading information is stored in a sitebit loading table.

Having stored the bit loading information for all of the secondarysites, the primary sites generates a lowest common denominator (LCD) bitloading table as a compilation of all of the site bit loading tables.From the LCD bit loading table and bandwidth requirements for theoutbound control channel, the primary site selects at least one outboundcarrier channel of the plurality of carrier channels to function as theoutbound control channel.

The inbound control channel is established in a similar way as theoutbound control channel except the primary site requests the trainingsignal from the secondary sites. Upon receiving the request, each of thesecondary sites responds in a sequential order. When the primary sitereceives the training signal from a secondary site, the primary siteperforms a spectral response on the inbound low pass transmission pathbased on the training signal. From the spectral response, the primarysite generates a bit loading table for the site. Once a bit loadingtable for all of the secondary sites has been generated, the primarysite generates an inbound control channel LCD bit loading table. Fromthis table the primary site selects, based on bandwidth requirements,inbound carrier channels to function as the inbound control channel.

Once the control channels are established, the system may provide callservices, where a call service includes the transmission of userinformation. When the primary site receives the call request, itdetermines the target sites involved in the requested call. Havingidentified the target sites, the primary site retrieves the site bitloading table for each target site and generates a lowest commondenominator (LCD) call bit loading table for this particular call. Fromthe call bit loading table and bandwidth requirements for thisparticular call, the primary site allocates carrier channels to providethe infrastructure for this particular call. In other words, the primarysite is selecting which outbound carrier channels will convey the userinformation from the primary site to the targeted secondary sites andthe inbound carrier channels that will convey the user data from thetargeted secondary sites to the primary site.

FIG. 8 illustrates a communications system 100 having a four wireinfrastructure. The communication system 100 includes a primary site102, a plurality of secondary sites 104-108 interoperably coupled to theprimary site via at least one inbound low pass transmission pass 148 andat least one outbound low pass transmission path 150. The primary site102 includes a controller 110, a DMT (Discrete Multi Tone) receiver 112,a DMT transmitter 114, a data multiplexing switch 116, and aninput/output port 118. Note that, if the secondary sites are separatedby more than a given geographic distance (12 K ft to 18 K ft) from theprimary site, a secondary site repeating the transmissions, repeaters144 146 may be required.

Each of the secondary sites 104-108 include a secondary site controller120, a secondary DMT receiver 122, a secondary DMT transmitter 124, asecondary data multiplexing switch 126 and at least one subscriberinterface 128. The subscriber interface may be coupled to a radiofrequency (RF) transceiver 140, an RF transmitter 136, a facsimiledevice 130, a telephone 132, or a television monitor 134. A detaileddiscussion of the secondary site will be provided below with referenceto FIG. 11.

The general operation of communication system 100 begins by establishingan inbound control channel on the inbound low pass transmission path 148and an outbound control channel on the outbound low pass transmissionpath 150. Establishing the inbound and outbound control channels will bediscussed in greater detail with reference to FIGS. 16-22.

Once the infrastructure control channels (i.e., the inbound and outboundcontrol channels) are established, user information may be transmittedto a subscriber. This is accomplished when the primary site receives acall request that identifies a targeted subscriber. The targetedsubscriber may be a communication unit 142, a pager unit 138, afacsimile unit 130, a telephone 132, a television 134, or any other typeof device that can receive digital information. Upon receipt of the callrequest, the primary site 102 determines the location of the targetsubscriber units. Having determined the targets' locations, the primarysite allocates carrier channels of the inbound and outbound low passtransmission paths 148, 150 depending on the type of call requested andthe bandwidth requirements for the call. For example, for a one way datatransmission, the primary site only needs to allocate carrier channelson the outbound low pass transmission path 150, while, for a two waydata transmission, the primary site would need to allocate carrierchannels in both the inbound and outbound low pass transmission paths148, 150.

To allocate the carrier channels, the primary site generates an inboundcall bit loading table from the inbound site bit loading tables of thetarget sites and an outbound call bit loading table from the outboundsite bit loading tables of the target sites. From the call bit loadingtables and the bandwidth requirements of the call, the primary siteselects the carrier channels to support the call. Once the carrierchannels have been selected, identity of the carrier channels are sentto the targeted secondary sites via the outbound carrier channelssupporting the outbound control channel. Note that establishing carrierchannels to support a particular call provides a temporarily designatedcommunication path between the primary sites and the targeted secondarysites for this call. Thus, the infrastructure links of the presentcommunication system are trunked to support a variety of calls which isin contrast to the dedicated links of prior art communication systems.

In addition to allocating carrier channels of the low pass transmissionpaths 148 150, the primary site may need to allocate transmissionresources within the secondary sites to provide a communication pathbetween the subscriber and the secondary site. For example, in a two-waywireless communication system, the primary site will allocate an RFcommunication resource in each secondary site supporting a two-waywireless communication. The control information identifying which RFcommunication resources have been allocated will be transmitted to thesecondary sites via the outbound carrier channels functioning as theoutbound control channel.

Once the secondary sites have received and stored the carrier channelallocation information, and any RF communication resource allocationinformation, the primary site 102 may transmit user information to thetargeted secondary sites via the allocated carrier channels. Uponreceiving the user information, the secondary sites can route the datato the targeted subscriber via the allocated RF communication resource.Additionally, the primary site, for a two-way communication, may receiveuser information via the allocated inbound carrier channels. Uponreceipt of this information, the primary site may retransmit thisinformation to the targeted secondary sites via the allocated outboundcarrier channels.

FIG. 9 illustrates a communication system 160 having a two-wireinfrastructure. As shown, the primary site 102 is operably coupled to aplurality of secondary sites 104-108 via a twisted pair low passtransmission path 162. The low pass transmission path is a twisted paircopper wire, which may be a telephone line. The basic interconnectionsof communication system 160 are very similar to the interconnections ofcommunication system 100. A difference arises in that communicationsystem 160 includes only one low pass transmission path, whilecommunication system 100 includes at least inbound and outbound low passtransmission paths. Because of this difference, the primary site 102 andeach secondary site include a two-wire to four-wire conversion hybrid164-170 to split inbound and outbound transmissions. In addition, theconversion hybrid provides echo cancellation such that data beingtransmitted via the DMT transmitter is removed from the data beingreceived by the DMT receiver. The two-wire to four-wire conversionhybrids 164-170 may comprise a transformer having a primary winding andat least one secondary winding and echo cancellation circuitry.

FIG. 10 illustrates a schematic block diagram of the primary site 102.The primary site 102 includes a controller 110, data multiplexing switch116, the DMT transmitter 114, the DMT receiver 112, memory 182,input/output port 118, input/output port 183, a data bus 176, a controlbus 178, and an address bus 180. The controller 110 includes a processor172 and memory 174. In practice, the controller 110 may be amicro-computer, a personal computer, a work station, or main framecomputer. Whichever type of processing device is used as the controller110, it should have sufficient processing power and memory to executethe primary site functions described throughout this specification.

In operation, the primary site determines, for data transmissions(calls), inbound and outbound carrier channel allocations for theinbound and outbound control channels; determines inbound site bitloading information for the plurality of secondary sites, i.e., the bitloading table for sites based on the spectral response of the inboundlow pass transmission path; determines call bit loading tables, i.e.,the bit loading tables that are based on a set of targeted secondarysites; determines carrier channel updates; and determines dataprocessing for the system. Each of these function will be discussed ingreater detail below.

The primary site may receive a request for data transmission from avariety of sources within the communication system and/or a variety ofsources external to the system. Requests from external sources may befor a page, a facsimile, a telephone interconnect, or any type ofcontrolling data transfer such as a data distributor's request to senddata to a particular subscriber. To receive requests from the externalsources, the primary site would include additional input/output ports.For example, the primary site would include a public switched telephonenetwork (PSTN) interconnection to support telephone interconnectoperations and to transceive facsimiles.

For requests that are received from within the communication system, therequests are from the carrier channels designated as the inbound controlchannel of the inbound low pass transmission path 148 by the DMTreceiver 112. The DMT receiver 112 may provide, under the control of thecontroller 110, the request to memory 182 or to the data bus 176. Thememory 182, which may be RAM (Random Access Memory), disk drive,magnetic tape, reel-to-reel, or any other type of digital storage means,stores information received from the DMT transceiver or any otherinformation which the controller 110 places within the memory. Note thatif memory 174 is of a sufficient size memory 182 may not be required.The DMT transceiver 112 will be discussed in greater detail below withreference to FIGS. 40-45.

The controller 110 obtains the request either by reading directly fromthe data bus 176 or from memory 182. Once the request is obtained, thecontroller 110 determines the type of service, or data transfer, beingrequested and the identity of the requesting subscriber. The request (orcall request) may be for a two-way wireless communication, a pagingrequest, a facsimile transmission, a POTS telephone call, a video datatransfer, an audio data transfer, a data file transfer, or any othertype of transmission of digital information that the communicationsystem can support.

Having extracted the requesting unit's identity and the type of servicebeing requested, the controller 110 determines whether the requestingunit is a valid user of the system. When the user has been validated thecontroller then determines whether this particular unit is authorized toreceive the service requested. When the unit is authorized to receivethe requested service, the controller 110 begins to process the requestsuch that it may be fulfilled. In general, to fulfill the requestedservice, the controller 110 must first allocate carrier channels on theoutbound low pass transmission path 150 (and the inbound transmissionpath 148 for two-way data transfers). Generally, carrier channelallocation is accomplished by retrieving the site bit loading tables foreach site supporting one of the target units (i.e., target sites) andcreating a call bit loading table for this particular call. Havingcreated the call bit loading table, the controller determines, based onbandwidth requirements of the call (data transfer), the carrier channelallocations. A further discussion of carrier channel allocation will bepresented below with reference to FIGS. 26-29.

Once the carrier channels are allocated, the controller 110 sends acarrier channel allocation message to the target sites via the carrierchannels designated as the outbound control channel for theinfrastructure. After informing the targets sites of the carrier channelallocation, the controller 110 obtains the requested data. The requesteddata may be obtained from an external data base 170, from an internaldatabase, from the system manager, or from a source within thecommunication system. The external database 170, or the internaldatabase, may store digital video information, digital audioinformation, data files, or any other type of digital information thatmay be of service to a subscriber. A source within the communicationsystem may be one of the subscribers (communication unit 142, a pagerunit 138, a facsimile unit 130, a telephone 132, a television 134, orany other type of device that can receive digital information of FIG. 9)affiliated with the system. For example, the communication unit 142 maytransmit a digitized audio message (or an analog audio message) via anRF communication resource to an RF transceiver (base station) affiliatedwith a secondary site. The secondary site processes the digitized audiomessage into a DMT symbol and places it on a carrier channel designatedas the inbound control channel.

Regardless of how the requested data was obtained, the controller 110routes the requested data to the data multiplexing switch 116. The datamultiplexing switch 116, which may be a TDMA (Time Division MultiplexingAccess) switch, processes the data into a time frame manner. Forexample, the data multiplexing switch processes the requested data as adata entry in a TDM frame. Generating a TDM frame of a plurality of dataentries is a well known process to one skilled in the art, thus nofurther discussion will be presented except to further explain thepresent invention. The TDM frame, and subsequent series of frames, isprovided to the DMT transmitter 114. The DMT transmitter, which will bediscussed in greater detail below with reference to FIGS. 34-39,transmits the data in the carrier channels of the outbound low passtransmission path 150.

To further illustrate the operations of the primary site 102, assumethat a two way wireless communication has been requested. For thisexample, the two way wireless communication request would be receivedvia the inbound low pass transmission path 148 in the carrier channel(s)designated as the inbound control channel. The request is received bythe DMT receiver 112 which routes the request directly to the controller110 or indirectly to the controller 110 via memory 182. Upon receivingthe request, the controller 110 determines whether the requestingcommunication unit is authorized to access the system and, if so,whether the requesting communication unit is authorized to access thisparticular service. If both inquiries are answered positively, thecontroller 110 determines whether a sufficient number of inbound carrierchannels and outbound carrier channels are available. If yes, thecontroller 110 determines whether there is a sufficient number of RFcommunication resources available to support the requested two waywireless communication. If this inquiry is answered positively, thecontroller 110 allocates the inbound and outbound carrier channels andthe RF communication resources for this particular call request.

Having made these allocations, the controller 110 transmits theallocations, via the carrier channels designated as the outbound controlchannel, to the target secondary sites. Each target secondary sitestores the carrier channel allocation information and data transmissionbegins. Data transmissions may begin when a communication unit transmitsan audio message to an affiliated RF transceiver which, in turn, routesa digitized representation of the audio message to a secondary site. Thesecondary site converts the digitized representation into a DMT symbol,or a plurality of DMT symbols, and transmits the DMT symbols in theinbound carrier channels allocated to support this particular call. Theprimary site receives the DMT symbols, reconstructs digitizedrepresentations, combines the reconstructed digitized representationswith other digitized representations. The combined digitizedrepresentations are then transmitted to the DMT transmitter whichconverts the combined digitized representations into DMT symbols. TheDMT symbols are placed on the carrier channels of the outbound low passtransmission path allocated for this call. The targeted secondary sitesreceive the DMT symbols and reconstructs the digitized representationsand routes it to the targeted subscribers. This process continues untilthe call ends.

FIG. 11 illustrates a schematic block diagram of a secondary site 108.The secondary site 108 includes a site controller 120, a datamultiplexing switch 126, a DMT transmitter 124, a DMT receiver 122,memory 190, a data bus 196, a control bus 198, an address bus 200, and aplurality of subscriber interfaces 128. As shown, the subscriberinterfaces 128 may be a base interface module 202, a paging interfacemodule 206, an audio/visual interface 210, a data interface 214, or aplain old telephone system interface 218. In operation, the DMT receiver122 receives information from an outbound twisted pair 150 and eitherplaces that information within the memory 190 or places it on the databus 196. Received control information is placed on the data bus 196 androuted to the site controller 120. The site controller includes aprocessor 192 and memory 194 and may be a personal computer, a workstation, or a main frame computer system. Note that if memory 194 is ofsufficient size memory 190 may not be needed.

Upon receiving the control information, the site controller 120interprets the control information and determines whether an action isrequired by the secondary site. For example, the control information mayindicate that one of the subscriber units affiliated with the secondarysite may be required to participate in a communication. Alternately, thecontrol information may indicate that a POTS call has been received,data is to be transferred, an audio/visual data sequence has beenreceived, or a paging request has been received. Regardless of what thecontrol information indicates, it is stored in memory such that thesecondary site controller can process, for the secondary site, theservice. Thus, when call information is transmitted on carrier channelsof the outbound low pass transmission path, the site controller 120extracts the data from the appropriate carrier channels and routes it tothe targeted subscriber.

As mentioned, the subscriber interfaces 128 can be of a variety ofdifferent types of interfaces. With a variety of subscriber interfaces,a secondary site can provide a variety of services to affiliatedsubscribers. For example, the base interface module 202 allows thesecondary site to interface with an RF base station 204 such thatsubscribers affiliate with the secondary site can access two-waywireless communications. The paging interface module 206 allows thesecondary site to interface with an RF paging station 208. Theaudio/visual interfaces 210 allows the secondary site 108 to interfacewith a television set 212, a cable box, a VCR, a virtual VCR, ateleconferencing interface, etc. The data interface 214 allows thesecondary site 108 to interface with a facsimile machine 216, a modem,or another type of digital interface device. The POTS interface 218allows the secondary site 108 to interface with a telephone 220.

The site controller 120, based on the control information, addresses theappropriate subscriber interface such that data may be received ortransmitted via the subscriber interface 128. For example, assume thatthe control information indicates a paging instruction. Upon receivingthe control information, the site controller interprets the paginginstruction to determine which carrier channels are being used to carrythe paging message and which particular subscriber units are to receivethe paging message. Having received and interpreted the controlinformation, the DMT receiver 122 subsequently receives the pagingmessage in the appropriate carrier channel and routes it, under thecontrol of the site controller 120, to the paging interface module 206via the data bus 196. Upon receiving the paging message, the paginginterface module 206 prepares it into an RF paging signal and transmitsit to the appropriate subscriber unit.

As an alternative example, assume that the control information indicatesa two way RF communication and a POTS communication. In this example,the site controller 120 stores the control information indicating thetypes of calls and the carrier channel which is carrying theinformation. When the DMT receiver 120 receives the call, it routes thedata to the base interface module 202 and the POTS interface 218 underthe control of the system controller 120. Thus, the two way RFcommunication information is prepared by the base interface module 202and routed to the appropriate subscriber units affiliated therewith.Similarly, the POTS interface 218 prepares the data and routes it to thetelephone 220.

Information may also be transmitted from the secondary site 108. In thismode, the DMT transmitter 124 places data on allocated carrier channelsof the inbound twisted pair 148. To do this, the DMT transmitter 124receives a digital data stream from the data multiplexing switch 126.The DMT transmitter 124 converts the digital data stream into aplurality of DMT symbols. The plurality of DMT symbols are placed on theallocated carrier channels. A detailed discussion of the DMT transmitter124 will be provided below which reference to FIGS. 35-39.

FIG. 12 illustrated a logic diagram that may be used by the primary siteto perform an overall system operation function. At step 230, theprimary site obtains outbound bit loading information from a pluralityof secondary sites. This is generally done by providing a trainingsignal to each of the plurality of secondary sites. The training signalis a DMT symbol comprised of a plurality of signals modulated on theeach of the carrier channels having a constant magnitude. Each of thesecondary sites calculate the bit loading information from a spectralresponse of the output transmission path, wherein the bit loadinginformation indicates, for each carrier channel, the number of bits thatthe carrier channel can support. Then, in a sequential manner, theplurality of secondary sites provide the outbound site bit loadinginformation to the primary site. The sequential order may be determinedby the primary site or predetermined polling algorithm.

At step 232, the primary site obtains inbound bit loading informationfrom the plurality of secondary sites. This is done by sequentiallyrequesting a second training signal from each of the secondary sites.Upon receiving the second training signal from a secondary site via theinbound transmission path, the primary site determines a spectralresponse of the inbound transmission path. From the spectral response,the primary site determines the inbound site bit loading information forthis particular secondary site. Once the bit loading information isobtained for this secondary site, the primary site determines theinbound bit loading information for the remaining secondary sites.

At step 234, the primary site utilizes the outbound bit loadinginformation to establish an outbound control channel. This is generallydone by determining, for each carrier channel within the bit loadingtables, a lowest bit loading value, having obtained the lowest value foreach carrier channel, a lowest common denominator (LCD) outbound controlchannel bit loading table is generated. From this LCD outbound controlchannel bit table, the primary site selects, based on bandwidthrequirements of the control channel, at least one carrier channel to actas the outbound control channel. The outbound control channel bandwidthmay be determined based on the type of system employing the systeminfrastructure of the present invention. For example, if the systemtransmits a substantial amount of data between the sites, the bandwidthrequirements will be much greater than the bandwidth requirements for asystem that has little data transmission between sites.

At step 236, the primary site utilizing the inbound bit loadinginformation to establish an inbound control channel. The primary sitechooses the inbound control channel in a similar fashion as it choosesthe outbound control channel. Note that the inbound and outbound controlchannels are being selected for the infrastructure of the system. Theseare not the RF control channels used by the subscriber units in a twoway communication system or the control channel used in a paging RFsystem.

At step 238, the primary site utilizes the inbound and outbound bitloading information to establish an infrastructure for a datatransmission. In general, this is accomplished by first determining thenumber of sites involved in the data transmission and retrieving theirrespective site bit loading tables. From the site bit loading tables, alowest common denominator call bit loading table is determined. From theLCD bit loading table for the particular data transmission, inbound andoutbound carrier channels are allocated to the data transmission basedon the bandwidth requirements. Note that for a system infrastructurehaving only an outbound transmission path would not normally allocateinbound carrier channels to the data transmissions.

FIG. 13 illustrates a logic diagram which may be used by the secondarysite to perform overall system operation functions. At step 240, thesecondary site determines whether it has received a request for outboundbit loading information. If the answer is yes, the process proceeds tostep 242 wherein the secondary site sends secondary bit loadinginformation. Generation of the outbound bit loading information is doneupon receiving a training signal from the primary site and calculating aspectral response of the outbound transmission path. From the spectralresponse, bit loading for each carrier channel is determining andcompiled into an outbound site bit loading table.

If the secondary site has not received a request for outbound bitloading information, it proceeds to step 246 where it is determinedwhether it has received a request to transmit a second training signal.If the answer is yes, the process proceeds to step 248 wherein thesecondary site transmits a second training signal to the primary site.The second training signal is a DMT symbol comprised of a plurality ofsignals modulated on the each of the carrier channels having a constantmagnitude.

If the secondary site has not received a request to transmit a trainingsignal, the process proceeds to step 250 where it determines whether ithas received a bit loading table. If the answer is no, the processproceeds back to step 240 and waits in a continuous loop until a requestfor outbound bit loading information is received, a request to transmita second training signal is received, or the secondary site receives bitloading information. When the secondary site receives bit loadinginformation, the process proceeds to step 242 where the secondary sitestores the bit loading information. The bit loading information isreceived from the primary site and typically comprises an LCD call bitloading table.

Having stored the bit loading information, the process proceeds to step254 where the secondary site determines whether it has received channelallocation information. If the answer is no, the process proceeds backto step 240. If, however, the answer is yes, the process proceeds tostep 256 where the secondary site determines whether the channelallocation information contains any relevant information for thesecondary site. The channel allocation information will contain relevantinformation for the secondary site when information is to be transmittedto one of the subscribers affiliated with this secondary site. Forexample, if a two way wireless cellular telephone is affiliated with thesecondary site, and the channel allocation information has the cellulartelephone involved in a communication, the channel allocationinformation will contain relevant information for the secondary site.Having determined that the channel allocation information containsrelevant information for the secondary site, the process proceeds tostep 258 where the relevant information is routed to an affiliatedtarget or a subscriber unit.

FIG. 14 illustrates a logic diagram that the primary site may utilize todetermine the inbound bit loading information and the outbound bitloading information. At step 260, the primary site transmits a firsttraining signal to all secondary sites. The training signal is amulti-frequency signal having a fixed amplitude. For example, thetraining signal may be a plurality of sinusoid signals having a constantamplitude wherein the frequency of each of the sinusoidal signalsequates to a carrier channel frequency in the ADSL bandwidth. Forexample, one sinusoidal signal will have a frequency of 25 kilohertz, asecond signal will have a frequency of approximately 29 kilohertz, athird signal will have a frequency of approximately 33 kilohertz,wherein each of the remaining sinusoidal signals will be increased byapproximately four kilohertz up to approximately 1.1 megahertz. Thus,there will be up to 256 signals combined into a DMT symbol, which istransmitted as the training signal.

In step 262, each of the secondary sites receives the first trainingsignal and determines a spectral response of the outbound transmissionpath. From the spectral response, an outbound bit loading table for aplurality of outbound carrier channel is generated. The spectralresponse is determined by analyzing each of the plurality of sinusoidalsignals of the training signal. In essence, the secondary sitedetermines the magnitude, and/or phase of the received sinusoidal signaland compares it to the magnitude and phase of the known transmittedsinusoidal signal. From the differences that occur, a spectral responsecan be obtained for an individual sinusoidal signal of the trainingsignal. The individual sinusoidal signal corresponds to a carrierchannel. From the spectral response, the secondary site can thencalculate the bit loading for this particular carrier channel. Forexample, if the sinusoidal signal for a particular carrier channel hadvery little degradation from its transmitted signal, the carrier channelcan handle a maximum number of bits. For an ADSL system, the maximumbits a carrier channel can accommodate per frame is 15 bits. Thus, asthe quality of the transmission path decreases, the number of bits of aparticular carrier channel can accommodate, or bit loading, decreases.Per ADSL requirements, the minimum number of bits a channel canaccommodate is two bits. Thus, if the spectral response of a particularcarrier channel is so poor that it would only accommodate 1 bit, thisparticular carrier channel is set to a bit loading of zero.

At step 264, the primary site begins collecting the outbound site bitloading tables from the sites by starting with a first secondary site.To retrieve the site bit loading table from the first secondary site,the primary site sends a request message to the secondary site wherein,upon receiving the request message, the secondary site responds with itsbit loading table. Upon receiving the bit loading table from the firstsecondary site, the primary site stores it and then proceeds to step 266where it requests the outbound bit loading table from another secondarysite. At step 268, the next secondary site transmits the outbound bitloading table to the primary site wherein the primary site stores theoutbound bit loading table as shown in step 270.

To collect inbound bit loading information from a secondary site, theprimary site transmits a second training signal request to a secondarysite. This is shown in step 272. The second training signal is similarto the first training signal in that it contains a plurality ofsinusoidal signals separated in frequency by approximately 4 kilohertzstarting at 25 kilohertz up to a frequency of 1.1 megahertz.

Upon receiving this request, a secondary site transmits the secondtraining signal to the primary site, which is shown at step 274. Uponreceiving the second training signal, the primary site determines aninbound bit loading table for a plurality of inbound carrier channelsbased on the spectral response of the secondary training signal, whichis shown at step 276. In addition, at step 276, the primary site storesthe inbound bit table for that particular secondary site. The primarysite calculates the spectral response in a similar fashion as thesecondary sites calculated the spectral response of the first trainingsignal. Having stored the inbound bit loading table and outbound bitloading table for a secondary site, the primary site determines at step278 whether is has obtained the inbound and outbound bit loading tablesfor all of the secondary sites. If not, the process repeats at step 266for a subsequent secondary site and continues in this loop fashion untilthe primary site has the inbound and outbound bit loading table for allof the secondary sites. Having done this, the process is complete.

FIG. 15 illustrates the process of obtaining the outbound bit loadingtables from a plurality of secondary sites. As shown, the primary site102 transmits a training signal 280 to a plurality of secondary sites104-106. The training signal 280 is shown in the frequency domain orspectral response. As mentioned above, the training signal 280 containsa plurality of sinusoidal signals having the same amplitude butseparated in frequency by 4 kilohertz. The starting frequency of thetraining signals may be 4 kilohertz or 25 kilohertz and runs up to 1.1megahertz.

The first secondary site 104, upon receiving the training signal,generates a spectral response for each of the sinusoidal signals of thetraining signal 280. From the spectral response, the secondary sitedetermines a bit loading for each of the carrier channel to produce abit loading table 282. As shown, the bit loading table of the firstsecondary site 104 has some carrier channels having more bit loadingcapabilities while others have less. Lower bit loading capabilitiesresult from the transfer function of the outbound transmission path atparticular carrier channels having more attenuation than other carrierchannels which have less attenuation.

The second secondary site 106 calculates a similar bit loading table andprovides the bit loading table back to the primary site 102. Note thatthe bit loading information from the first secondary site 104 isconsiderably different than the bit loading information from the secondsecondary site 106. This occurs due to different characteristics in thetransmission path between the primary site and the first secondary siteand the transmission path between primary site and the second secondarysite 106. Typically, the first secondary site 104 and the secondsecondary site 106 will be separated by a significant amount orgeographical difference such that the characteristic impedance of thetransmission path connecting the particular secondary sites to theprimary site will be different.

FIG. 16 illustrates a logic diagram which the primary site may utilizeto select an outbound control channel. At step 290, the primary sitecopies the outbound bit loading table of a first secondary site and toan outbound control channel bit loading table. The outbound controlchannel bit loading channel at this stage is identical to the outboundbit loading table of the first secondary site, thus, it contains thenumber of bits that a particular carrier channel can accommodate foreach of the plurality of carrier channels, which, for an ADSL system, is256.

As step 292, the primary site looks at a next secondary site's outboundbit loading table. At step 294, the primary site starts with the firstcarrier channel entry in the outbound bit loading table of the nextsecondary site and the first carrier channel entry in the outboundcontrol channel bit loading table. At step 296, the bit loading, or bitnumbers, for the first carrier channel entry in the respective outboundbit loading tables are compared. At step 298, the lessor of the two bitnumbers, or bit loading, is stored in the outbound control channel bitloading table. At step 300, the primary site determines whether all ofthe carrier channel entries have been compared. When all of the carrierchannels have not been compared, the process proceeds to step 302 wherethe next carrier channel entry in the outbound control channel bitloading table is compared with the corresponding entry in the nextsecondary site's bit loading table.

If, however, all of the carrier channels entries have been compared, theprocess proceeds to step 304 where the primary site determines whetherit has compared the outbound control channel bit loading table with theoutbound bit loading tables for all of the secondary sites. If theanswer is no, the process proceeds to step 292 wherein the bit loadingtable of another secondary site is compared with an updated outboundcontrol channel bit loading table.

If, however, the primary site has compared all of the bit loading tablesof all of the secondary sites to obtain the outbound control channel bitloading table the process proceeds to step 306. At step 306, the primarysite determines outbound control channel bandwidth requirements. Asmentioned, each carrier channel may accommodate between 2 to 15 bits perframe. In an ADSL system, the frequency spectrum is transmitted onceevery 250 microseconds or at a 4 kilohertz rate. Thus, one particularcarrier channel can accommodate a given bandwidth based on the frameduration. For example, assume that a particular carrier channel canaccommodate 2 bits, at the 4 kilohertz rate, the carrier channel cansupport a call having a bandwidth of 8 Kbps (kilobits per second). Thus,if the outbound control channel requires a bandwidth of 32 kilobits persecond, a carrier channel that can accommodate 8 bits is required, or asum of carrier channels that can accommodate 8 bits is required, for thecontrol channel.

Given the outbound carrier channel bandwidth requirements and accessingthe outbound bit loading table, an outbound control channel is selectedat step 308. Having selected the outbound control channel, the primarysite transmits a signal to all the secondary sites indicating thecarrier channel allocations as the control channel. This is done at step310. In general, the outbound control channel is used to transmitcontrol information from the primary site to the plurality of secondarysites. Having transmitted the control channel message to the secondarysites, the process is complete.

FIG. 17 is an illustrative example of how the outbound control channelbit loading table 338 is generated. Outbound bit loading tables for theplurality of sites are shown as outbound site bit loading tables320-324. Each of the outbound bit loading tables 320-324 contains acarrier channel field 326-330 and a bit loading field 332-336. Asmentioned, an ADSL system has 256 carrier channels such that each of thesite bit loading tables 320-324 includes 256 carrier channel entries.

The outbound control channel bit loading table 338 is generated bycomparing the bit loading, on a carrier channel by carrier channelbasis, of all of the site bit loading tables. Thus, to begin producingthe outbound control channel bit loading table 338, the bit loadingtable for the first site 320 is copied as the outbound control channelbit loading table 338. Next, a carrier channel by carrier channelcomparison is made between the information stored in the outboundcontrol channel bit loading table 338 and the outbound bit loading tableof the remaining two sites 322 324. Thus, comparing the bit loading ofcarrier channel 1 of site two with the bit loading information ofcarrier channel 1 in the outbound control channel bit loading table 338,it is seen that the bit loading of carrier channel 1 in site two is lessthan the bit loading of channel 1 in site one. Thus, the outboundcontrol channel bit loading table 338 is updated with the lessor of thetwo bit loading values, or in this case, 12 bits as indicated in thesite bit loading table 322 of site two.

Next, the bit loading for carrier channel 2 is compared between the sitebit loading table 322 of site two and the outbound control channel bitloading table 338. As seen, the bit loading for carrier channel 2 forthe first and secondary sites is 13 bits. Note that from FIG. 17, theoutbound control channel bit loading table 338 has 12 bits for the bitloading of carrier channel 2. This is due to the bit loading informationof site three. As shown in site three, the bit loading for carrierchannel 2 is 12. This process continues on a carrier channel by carrierchannel basis until the outbound control channel bit loading table 338contains, for each carrier channel entry, the lowest bit loading valueof all of the site bit loading tables.

Note that the comparison of bit loading information of all of the sitebit loading tables may be done in a variety of ways. For example, all ofthe tables may be compared simultaneously to generate the outboundcontrol channel bit loading table 338. Alternately, the comparison maybegin at control channel 256 or in any other manner. It should bereadily apparent to one skilled in the art that there are a plurality ofways to generate the outbound control channel bit loading table 338 fromthe plurality of site bit loading tables 320-324.

FIG. 18 illustrates a logic diagram that the primary site may utilize toupdate the outbound control channel. As is known, over time thetransmission characteristics of the telephone line changes. Thusrequiting the spectral response of the data line to be periodicallyupdated. The ADSL standard dictates that once every 69 frames thetraining sequence be transmitted which may be used to update the bitloading. Thus, the spectral response of the transmission path is beingupdated every few hundred milliseconds.

At step 350, the primary site begins the updating of the outboundcontrol channel by periodically transmitting the first training signalto all of the secondary sites. As mentioned above the training signalcomprises a plurality of sinusoidal signals having a similar amplitudebut separated in frequency by approximately 4 kilohertz in the range of25 kilohertz up to 1.1 megahertz. At step 352, the secondary sitesreceive the first training signal and generate a new outbound bitloading table. The new outbound bit loading table may be separatelystored from the existing outbound bit loading table or may overwrite theexisting outbound bit loading table after changes are identified. Recallfrom the above discussion that the outbound bit loading table isgenerated from a spectral response of the transmission path as itreceives the first training signal. The spectral response is thenequated to the number of bits that a particular carrier channel canaccommodate, which, in turn, is used to generate the outbound bitloading table.

At step 354, each of the secondary sites compare the new outbound bittable to the old outbound bit loading table to identify any changes. Atstep 356, the secondary sites generate a changed message indicating theidentity of any changes. Note that the secondary site may generate a nochange message if no changes have occurred or may simply omit generatinga message entirely.

At step 358, the primary site, in a sequential order, requests eitherthe new bit loading table, or a change message from a first secondarysite. At step 360, the primary site sends a request to the secondarysite for the change message which is transmitted by the secondary siteat step 362. At step 364, the primary site receives the changes messageand updates its outbound site bit loading table for the particularsecondary site. At step 366, the primary determines whether it hasupdated the outbound bit loading tables for all of the secondary sites.If not, the process repeats at 360 until all of the outbound site bitloading tables have been updated. Once all of the outbound site bitloading tables have been updated, the primary site determines whetherthe outbound control channel bandwidth requirements are met by thecurrent carrier channel allocations. This occurs at step 368. If thebandwidth requirements are met the process is complete. If, however, thebandwidth requirements are not met the primary site reallocates carrierchannel to redefine the outbound control channel. This occurs at step370 and will be discussed in greater detail with reference to FIGS.30-33.

FIG. 19 illustrates a logic diagram that may be used to establish aninbound control channel 380. At step 382, a first inbound bit loadingtable of a secondary site is copied into an inbound bit loading table.This is a similar step as that done for the outbound control channelcase described above. At step 384, the bit loading table for asubsequent secondary site, or next, secondary site is retrieved. At step386, a comparison, which is done on a carrier channel by carrier channelbasis, is made between the bit loading information of the inboundcontrol channel bit loading table and the next secondary site bitloading table.

At step 388, for the first carrier channel, the bit numbers, or bitloading, for this carrier channel is compared between the bit loadinginformation in the inbound control channel bit loading table and thenext secondary site bit loading table. At step 390, the lessor of thetwo bit loading values is stored in the inbound control channel bitloading table. Thus, if the data already in the inbound bit controlchannel bit loading table is the lessor of the two values, that valueremains, otherwise, the bit loading value for the next secondary site isstored in the inbound control channel bit loading table.

Having compared the bit loading of the first carrier channel entry inthe inbound control channel bit loading table and the next secondarysite bit loading table, the process proceeds to step 392, where adetermination is made as to whether all the carrier channel entries havebeen compared. When there are further carrier channel comparison to bemade, the process proceeds to step 394 wherein the bit loading of thenext carrier channel entry in the inbound control channel bit loadingtable and next secondary site bit loading table are compared as shown instep 388. At step 390, the lessor of the two bit loading values isstored in the inbound control channel bit loading table.

When the bit loading of all of the carrier channel entries of the nextsecondary site has been compared to the inbound control channel bitloading table, the process proceeds to step 396 where it is determinedwhether all of the secondary site bit loading tables have been comparedto the inbound control channel bit loading table. If not, the processreturns to step 384 where the next secondary site bit loading table iscompared with the most current inbound control channel bit loadingtable.

If, however, all of the secondary site bit loading tables have beencompared to the inbound control channel bit loading table, the processproceeds to step 398 where inbound control channel bandwidthrequirements are determined. The inbound control channel bandwidthrequirements can be determined by accessing a database where bandwidthrequirements are stored, or inputted by a user of the communicationsystem infrastructure. For example, if 32 kilohertz of bandwidth areneeded, given that a frame cycle is 250 microseconds, or operating at a4 KHz rate, the inbound control channel needs 8 bits per frame to meetthe bandwidth requirements.

Once the bandwidth requirements have been obtained, the process proceedsto step 400 where at least one of a plurality of inbound carrierchannels is selected as the inbound control channel from the inboundcontrol channel bit loading table based on the bandwidth requirements.Having selected at least one of the plurality of inbound carrierchannels to function as the inbound control channel, the prime sitesends a message to all the secondary sites identifying the inboundcarrier channel, or channels, functioning as the inbound controlchannel, this is done at step 402. Once the inbound control channel hasbeen identified, the secondary sites may access the inbound controlchannel in a variety of ways. For example, the secondary sites mayaccess the inbound control channel in a time division multiplexingaccess manner (TDMA), a frequency division multiplexing accessing manner(FDMA), or a combination of TDMA and FDMA. This is depicted at step 404and will be further described with reference to FIGS. 20 and 21.

FIG. 20 illustrates an example of the secondary sites accessing theinbound control channel in an FDMA manner. For the purposes of thisexample, assume that the inbound transmission path of the communicationsystem infrastructure includes 10 inbound carrier channels, the inboundcontrol channel bandwidth is 12 bits, and the communication systemincludes 5 secondary sites. Given these assumption, FIG. 20 illustratesfive site bit loading tables 410-418, one for each of the secondarysites. From each of the site bit loading tables, an individual inboundcarrier channel has been identified to function as the inbound controlchannel for the respective site. Thus, the inbound control channel forsite 1 is carrier channel one 420; for site 2, is carrier channel zero422; for site 3, is carrier channel three 424; for site 4, is carrierchannel two 426; and for site 5, is carrier channel four 428.

As shown, in the FDMA accessing scheme, each secondary site is allocateda carrier channel to function as its own inbound control channel. Asinformation is placed into frames, each frame is formatted to includethe allocated carrier channels. An exemplary frame is shown withreference designation 430, which has five of the available carrierchannels allocated to the secondary sites for use as inbound controlchannels. Typically, not all of these secondary sites will not transmitinformation on its allocated inbound carrier channel during every frame.Thus, many of the carrier channels functioning as inbound controlchannels will not be carrying information. Note that when an FDMAapproach is used to access the inbound control channel, the method ofFIG. 19 is not required because each site is allocated a separateinbound carrier channel to function as the inbound control channel. Theseparate inbound carrier channels can be selected from the individualsite bit loading tables, thus no inbound call bit loading table isgenerated.

As an alternative to the FDMA process, the communication infrastructuresystem may incorporate a TDMA process. Under the TDMA process, aninbound carrier channel, or channels, will be selected as described inFIG. 19. With the inbound carrier channels selected, the sites wouldaccess the inbound control channel in a sequential order. Thus, for afirst frame, site 1 would have exclusive access to the inbound controlchannel, during frame 2, the second site would have exclusive access tothe inbound control channel followed by site 3, 4 and 5. This sequentialaccessing process continues in a round robin fashion.

The TDMA approach works well for a communication system having a fewsites. With only a few sites, each site would not have to wait too longto obtain access to the inbound control channel. When there are numeroussites, however, the TDMA approach has excessive delays betweenallocation of the inbound control channel to a particular site.

As a compromise between the TDMA approach and FDMA approach, acombination of the TDMA and FDMA approach may be used. FIG. 21illustrates an example of a 10 inbound carrier channel, 5 site system,where the inbound control channel bandwidth requirements are 12 bits. Inaddition, sites 1-5 are divided into two sets: sites 1-3 are in set A,while sites 4 and 5 are in set B. Having divided the sites into sets, alowest common denominator (LCD) bit loading table for each set isdetermined. The LCD bit loading tables are generated in the same fashionas the inbound control channel bit loading table as described in FIG.19.

As shown, the LCD bit loading table for set A is bit loading table 434,while the LCD bit loading table for set B is bit loading table 436. Fromthese bit loading tables 434 436, a carrier channel or carrier channelsis selected to support the inbound control channel for each set. Asshown, carrier channel one 438 was selected to support set A, whilecarrier channel zero 440 was selected to support set B. Thus, for eachframe, carrier channel 0 is dedicated for inbound control informationfor the set of sites B, while carrier channel 1 is dedicated for inboundcontrol channel information for sites in set A. In this manner, the setsaccess the inbound control channel in an FDMA manner, while the sites ofthe sets access in the inbound carrier channel in a TDMA manner.

As shown in frame N 442, site 1 of set A accesses the inbound controlchannel, while site 4 of set B accesses its respective inbound controlchannel. At frame N+1 444, site two access the inbound control channelfor set A, while site 5 accesses the inbound control channel for set B.At frame N+2, 446, site 3 is accessing the inbound control channel forset A while site 4 is again accessing the inbound control channel forset B. At frame N+3 448, site 1 is again accessing the inbound controlchannel for set A while site 5 is again accessing the inbound controlchannel for set B. This TDMA/FDMA process continues in such a roundrobin fashion for each frame.

From the descriptions of FIGS. 20 and 21 it should be readily apparentto one skilled in the art that the inbound control channel may beestablished and accessed in a variety of ways. The manner in which thesites access the inbound control channel will depend on the prioritylevels of the sites, and the frequency in which the sites have inboundcontrol channel information to transmit. For example, if a particularsite is supporting a dispatch station used by a municipalities' policeand/or emergency medical departments, this site would require constantaccess to the inbound control channel such that delays in obtainingemergency service are eliminated. Thus, this type of site would needFDMA access to the inbound control channel, In contrast, a site may besupporting a plurality of telephone user or video subscribers, wherein afew hundred millisecond delay is inconsequential. Thus, these sitescould withstand a delay in accessing the inbound control channel where aTDMA approach would be sufficient. If both types of sites are affiliatedwith a communication system, the system would employ the FDMA/TDMAapproach.

FIG. 22 illustrates a logic diagram that may be used to updateallocations of inbound carrier channels to the inbound control channel450. At step 452, the process begins by selecting a first one of thesecondary sites. The selection of a first secondary site may be done ina variety of ways. For example, the primary site may select thesecondary sites in a round robin fashion according to one of the primarysite's databases. Having selected the first secondary site, the processproceeds to step 454 where the primary site requests a second trainingsignal from this particular secondary site. At step 456, the secondarysite transmits a second training signal to the primary site. At step458, the primary site receives the second training signal and determinesa new inbound site bit loading table for the particular site. Theprocess of receiving a training signal and determining a bit loadingtable was discussed above with reference to FIG. 14. At step 460, theprimary site compares the new inbound bit loading table to thepreviously stored inbound bit loading table to identify changes, wherechanges may be in the form of bit loading increases for a particularcarrier channel or bit loading decreases for a particular carrierchannel.

Having identified the changes, the process proceeds to step 462 where itis determined whether all the sites have been updated. If not, theprocess returns to step 454 for the next site. If, however, all thesites have been tested for changes the process proceeds to step 464. Atstep 464, the process determines whether any changes have occurredbetween the new bit inbound site bit loading table for each of thesecondary sites and the previously stored site bit loading table foreach of the secondary sites. For each secondary site that did not have achange, the primary site maintains the previously stored site bitloading table as the updated bit loading table and using thisinformation for future carrier channel allocations for the site.

If, however, a change has occurred between the new site bit loadingtable for a particular site and the previously stored site bit loadingtable for the particular site, the process proceeds to step 466 wherethe previously stored inbound site bit loading table is updated with thechanges. In other words, the carrier channel entries having bit loadingchanges will be overwritten with the most current bit loadinginformation for the particular carrier channel, which is the informationcontained in the new site bit loading table.

While the process shows testing all of the sites for changes beforeupdating any of the individual site bit loading tables, one skilled inthe art will readily recognize that a variety of updating techniques maybe used. For example, the process may involve updating the individualsite bit loading tables as changes are being identified for that sitebefore testing for changes in other sites' bit loading tables. Asanother approach, the newly generated site bit loading table may be usedas the updated inbound site bit loading table such that the previouslystored site bit loading table is deleted or overwritten. Yet anotherapproach may to change the carrier channel entries that have beenidentified as have a bit loading change without generating a new sitebit loading table.

Returning to the discussion of the process, at step 466, the inboundcontrol channel bit loading table is updated based on the updated sitebit loading tables. The inbound control channel bit loading table isupdated as a compilation of all of the changes that occurred for eachsite. Recall that the inbound site bit loading table is a compilation ofall of the inbound site bit loading tables and contains the lowest bitloading for each inbound carrier channel. Having updated the inboundcontrol channel bit loading table, the process, at step 468, determineswhether the carrier channels currently functioning as the inboundcontrol channel still meet the bandwidth requirements for the inboundcontrol channel. If yes, the process is complete.

If, however, the carrier channels currently functioning as the inboundcontrol channel do not meet the bandwidth requirements, the inboundcontrol channel assignments must be redefined. This is determined atstep 470. The determination of new carrier channels to function as theinbound control channel will be discussed in greater detail withreference to FIGS. 30-33.

FIG. 23 illustrates a logic diagram that may be used to establish a callwithin a communication system using the above described discretemulti-tone (DMT) infrastructure. For the purposes of this discussion, acall may be any form of data transfer that the communication system cansupport. For example, the call may be for a video data transfer, anaudio data transfer, a page to a pager or pagers, a two-way RFcommunication, a facsimile, a plain old telephone service (POTS) call, acellular telephone call, a data file transfer, status informationrequests and/or transfers, telephone interconnections, and other digitalinformation transfers.

The process begins at step 480 where at least one call request isreceived from a user via a secondary site and an inbound controlchannel. As an alternative to receiving the call request from a user,the call request may be received from an external source. For example,the call request may be a facsimile request from a telephone user via atelephone interconnect, where the targeted recipient of the facsimile isaffiliated with a secondary site (e.g. the recipient is a facsimilemachine coupled to a cellular telephone or land mobile radio). Asanother example, the call request may be from the system manager whichis requesting status information, is updating security codes with mobileradios, is changing service parameters of a mobile radio, pager, orcellular telephone, or other types of system managing functions. As yetanother example, the call request may be from a dispatch station, wherethe dispatch station may be coupled to the primary site or a secondarysite.

Regardless of the type of request, the process proceeds to step 482,where the validity of the user and request are determined. The validityof the user is verified by the secondary site to determine if the useris an affiliated user, where an affiliated user is one that thesecondary site can identify from a database as being registered with thesecondary site. If not affiliated, the user is not validated. Ifverified by the secondary site, the primary site may also perform avalidity check of the user to further insure that the user is valid. Therequest may be validated by the secondary site, the primary site, orboth. To validate the request, the primary site--and, when the secondarysite is validating the request, the secondary site--includes a databasewhich stores the types of requests the user may validly transmit. Inother words, the database contains a list of services the user mayaccess via the communication system. If either the request or the useris not validated, i.e. the user is not authorized to make the particularrequest or the user is not authorized to access the system, the processproceeds to step 484 where the particular call request is denied.

In addition to validating the user and the request, the targeted unitsmay also be validated. A targeted unit is validated in a similar manneras the requesting user. In other words, when the primary site hasextracted the identity of the targeted unit, the primary site determineswhether the targeted unit is affiliated with the communication system.If not, the request, at least for that targeted unit, is denied.

When the user and request are valid, the process proceeds to step 486where the type of call is determined from the particular call request.Note that the call request includes the identity of requesting unit, thetype of call being requested, and a target destination. Havingdetermined the call type, the process proceeds to step 488 where thenumber of required bits is determined by accessing a database of calltypes and corresponding bits required. As an example, the types of callsand their corresponding bit requirements stored in the database may bedigital audio communications having a 64 kilobits per second (Kbps)requirement, 32 Kbps requirement, 16 Kbps requirement, or 8 Kbpsrequirement; digital video communications having, for example, a 100Kbps requirements, a 1 Mbps requirements, or a 2 Mbps requirement;facsimile transmissions having a 4.8 Kbps, a 9.6 Kbps, or greater; ordata file transfers having any data rate requirements.

Given the data rate requirements, and the frame rate of the DMT or ADSLsystem is 4 kilohertz, the digital audio having data rate requirement of64 Kbps requires 16 bits per frame to be properly supported by thecommunication system infrastructure. The 16 bit requirement isdetermined by divided the 64 Kbps data rate requirement by 4 KHz. Usingsimilar calculations, the 32 Kbps digital audio would require 8 bits perframe, the 16 Kbps digital audio would require 4 bits per frame, and the8 Kbps digital audio would require 2 bits per frame. The bit requirementper frame for other types of data transmissions, or transfers, would becalculated in an identical manner. Thus, the database of call types andcorresponding bits required would be broken down to the particular calltype (e.g. 64 Kbps audio) and the corresponding number of required bitsper frame (e.g. 16 bits).

Having determined the number of required bits, the process proceeds tostep 490 where the location of at least two targets are determined basedon the particular call request. For example, if the call request is fora two-way RF communication, the targets may be other communication unitslocated in different sites. Alternatively, the call request may be for apage of a number of particular pagers located in a plurality of sites.As yet a further alternative example, the request to transmits the samedigital video information to a plurality of users. As one skilled in theart will readily appreciate, the call request could be for any digitalinformation conveyance that the communication system can support.

Having identified the location of the targets, the process proceed tostep 492 where an ordered bit loading table for the call is generated.The ordered call bit loading table is generated by first accessing thedatabase of site bit loading tables to retrieve a site bit loadingtables for each of the sites supporting one of the at least two targets,i.e., the sites that have at least one of the targets affiliatedtherewith. Having retrieved the site bit loading tables, the tables arecompared, on a carrier channel by carrier channel basis, to determinethe lowest bit loading for each carrier channel. Once the lowest bitloading for each carrier channel is identified, available carrierchannels are identified from a carrier channel allocation informationdatabase. From this information, the carrier channel entries for theavailable carrier channels are arranged in an ordered fashion to createthe ordered bit loading table.

The ordered fashion may be ordering the carrier channel entries--1 acarrier channel and it's associated bit loading -- from the carrierchannel having the lowest bit loading to the carrier channel having thehighest bit loading. Alternatively, the table could be ordered from thecarrier channel having the highest bit loading to the carrier channelhaving the lowest bit loading. The ordering of the order call bitloading table should coincide with a constellation encoding scheme. Forexample, if the constellation encoding scheme is loading data on tocarrier channels having the highest bit loading first, the ordering ofthe ordered bit loading table should be the carrier channel having thehighest bit loading to the carrier channel having the lowest bitloading. One skilled in the art will readily appreciate that theordering of the ordered bit loading table may be done in a variety ofways other than the examples mentioned.

With the ordered bit loading table generated, at least one of thecarrier channels is allocated to the call request as shown in step 494.Allocations of carrier channels to a particular call request will bediscussed in greater detail with reference to FIGS. 26-29. Having donethis, the process proceeds to step 496, where a carrier channel in usedatabase, or carrier channel allocation information database, isgenerated. This database, as the name implies, indicates which carrierchannels are assigned to which particular call. This will be describedin more detail below.

At step 498, the process determines whether a second call request isreceived. When a second call request has not been received, the processproceed to step 500 where it is determined whether the current call hasended. If not, the process waits until either a second call request isreceived or a current call ends. When a current call ends, the processproceeds to step 502 where the allocated carrier channels are reclaimedand the carrier channel in use database is updated. Having reclaimed theallocated carrier channels, they are available for allocation to anothercall.

When a second call is received, the process proceeds to step 504, wherethe validity of the user and the requested service are tested. If not,the process proceeds to step 506 where the second call request isdenied. Having denied the second call request, the process returns tostep 498 where the process waits to receive either a second call requestor for a current call to end.

When the request and the user of the second call request are valid, theprocess proceeds to step 508 where the type of call for the second callrequest is determined. (Recall that the type of call being requested canbe directly determined from the call request.) Having determined thetype of call request, the process proceeds to step 510 where the numberof bits required for the second call are determined. (Recall that thenumber of required bit may be determined by accessing the call type torequired bits table.) Having done this, the process proceeds to step512, where the locations of the targets for the second call aredetermined. (Recall that this is done by accessing a subscriber-locationdatabase within the primary site.) From this the process proceeds tostep 514, where a second ordered bit loading table is determined. Notethat the second ordered bit loading table will be comprised of thelowest bit loading information for the plurality of sites involved inthe second call less any carrier channels in use as identified in thecarrier channel in use database. Thus the ordered bit loading table willinclude only an ordered representation of available carrier channels.

At step 516, the process determines whether there are a sufficientnumber of carrier channels available to support the second call. This isgenerally accomplished by determining the total number of available bitsby summing the bit loading of the available carrier channels. If thetotal number of available bits compares favorably (e.g. greater than) tothe number of required bits for the call, then there are a sufficientnumber of carrier channels to support the call. If the processdetermines that there are not a sufficient number of available carrierchannels, the process proceeds to step 518, where the second call isqueued, or denied.

If, however, there are a sufficient number of carrier channelsavailable, the process proceeds to step 520 where carrier channels areallocated to the second call. (Allocation of carrier channels to a callwill be discussed in greater detail with reference to FIGS. 26-29.Having allocated the carrier channels, the process proceeds to step 522where the carrier channel in use database, or carrier channel allocationinformation database, is updated to indicate the carrier channels thathave been allocated to the second call. Once this is completed, theprocess returns to step 498 where is waits to receive another callrequest or for a current call to end.

FIG. 24 illustrates a logic diagram that may be used to implementcarrier channel allocations for call requests in a four wire system,i.e. one that has a dedicated inbound transmission path and a dedicatedoutbound transmission path. At step 530, the primary site receives atleast one call request. The process then proceeds to step 532 where itdetermines whether the user and the call request are valid. If eitherthe user or the call request is invalid, the primary site denies therequested service and the process ends for this call request. If theuser and call request are valid, step 532 further determines the type ofcall from the call request.

At step 534, the process determines the number of bits required for thisparticular call. (Recall that this is done by accessing a calltype-to-required bit database stored within the primary site.) At step536, the process identifies the sites in which the at least two targetsare located. From this, the process proceeds to steps 538 and 540 wherethe primary site generates an inbound ordered bit loading table and anoutbound ordered bit loading table. Note that steps 538 and 540 may bedone simultaneously, or in a sequential fashion as shown or in inversesequential fashion. A detailed discussion for the generation of theinbound and outbound ordered bit loading tables will be done below withreference FIG. 28.

Having generated the inbound and outbound ordered bit loading tables,the process proceeds to step 542 and determines whether each of theinbound and outbound transmission paths have sufficient carrier channelsavailable. In other words, the process determines if there is asufficient number of inbound carrier channels and a sufficient number ofoutbound carrier channels to support the requested call. If not, theprocess proceeds to step 544 and queues the particular call request.Alternatively, the process, via the primary site, may deny theparticular call request. If, however, there are a sufficient number ofinbound and outbound carrier channels, the process proceeds to step 546.

At step 546, the process allocates at least one inbound and at least oneoutbound carrier channel to the particular call request. (The allocationof carrier channels to a particular call will be discussed in greaterdetail below with reference to FIGS. 26-29.) At step 548, the primarysite transmits the identity of the allocated inbound and outboundcarrier channels to the sites supporting the at least two targets viathe outbound control channel. In practice, each of the secondary siteswill receive the control information (i.e., the identity of theallocated inbound and outbound carrier channels), but the controlinformation will contain an address identifying the targeted sites(i.e., the sites supporting the at least two target units) such thatonly the addressed sites will process the control information.

After allocating the carrier channels, the process proceeds to step 550where the primary site determines, for a one-way or two-way wirelesscommunication call request, whether each target site has an available RFcommunication resource, or channel. When each site has an available RFcommunication resource, the primary site allocates the RF communicationresources to the particular call. At step 552, the primary sitetransmits control information, via the outbound control channel, to thetarget sites, wherein the control information identifies the allocatedRF communication resources.

One skilled in the art will appreciate that the present invention, forone-way RF communications (e.g. paging) and two-way RF communications(e.g. land mobile and/or cellular telephone) has two layers of resourcetrunking. The first layer, which is done in prior art communicationsystems, is the trunking of RF communication resources. As is known, bytrunking RF communication resources, as opposed to dedicated RFcommunication resources to particular users, a communication system isable to support more users because the RF communication resources arebetter utilized. The second type of trunking, which is provided by thepresent invention, is the trunking of infrastructure resources. Thus,instead of the dedicated T1 links, fiber-optic links, or microwave linkscoupling the secondary sites to a primary site, or central controller,the present invention trunks the infrastructure resources based on callrequests. By using infrastructure trunking, expensive T1 links,expensive fiber optic links, and expensive microwave links can bereplaced with inexpensive twisted pair copper wire telephone lines. Thisis of added benefit in newly emerging industrialized nations that have alimited communication infrastructure of twisted pair copper wiretelephone lines and little, if any, of the more expensive transmissionlinks.

Returning to the discussion of the logic diagram of FIG. 24 at step 554,where at least one of the target sites receives a portion of an RFcommunication. For the purposes of this discussion, a portion of an RFcommunication may be, for a two-way RF communication, an audio or datatransmission by a first RF communication device where a subsequentportion of the RF communication would be an audio or data transmissionin connection with the first portion of the RF communication. Forexample, assume that the two-way RF communication is between a policeofficer and a dispatch operator at a police station, where the firstportion of the RF communication is the dispatcher requesting the policeofficer to identify his or her location. The second portion of the RFcommunication would be the police officer's response.

Alternatively, the RF communication may be for a one-way RFcommunication. In this situation, the portion may constitute the entireRF communication. For example, the RF communication may be used for datatransmissions from remote data collection sites, where the data sitetransmits its data at given time intervals without prompting from theprimary site.

After the site receives the portion of the RF communication the processproceeds to step 556 wherein the site converts the RF communication intoa discrete multi-tone (DMT) message. This conversion process wasgenerally discussed with reference to FIGS. 8-13 and will be moredetailedly discussed with reference to FIGS. 34-39.) Having convertedthe RF communication into a DMT message, the site transmits the DMTmessage to the primary site via the allocated inbound carrier channel,or channels, for this particular call. This is depicted at step 558.

At step 560, the primary site processes the DMT message and routes theprocessed DMT message to the target sites. (The processing of DMTmessages was generally discussed with reference to FIGS. 8-13 and willbe discussed in greater detail with reference to FIGS. 40-46.) Theprocessed DMT message, which may be a summation of several RFcommunication portions, is routed to the target sites via the outboundcarrier channel or channels allocated to this particular call. Havingreceived the processed DMT message, the sites convert the processed DMTmessage into a digital message and route the digital message to thetarget units via the allocated RF communication channels. This isdepicted at step 562.

While the first, or another, call is active, the process determineswhether a second call request has been received which is shown in step564. Note that at any point during the process, a call could be receivedand processed as described herein. If a second call has not beenreceived, the process proceeds to step 556 and determines whether acurrent call has ended. If a current call has not ended, the processwaits for another call request or for a current call to end. If acurrent call ends, the process proceeds to step 568 where the allocatedcarrier channels of the inbound and outbound transmission paths arereclaimed and the carrier channel in use database, or carrier channelallocation information database, is updated.

When a second call request is received, the process proceeds to step 570where the process determines the type of call requested. Havingdetermined the type of call the process proceeds to step 572 where theprocess determines the number of required bits for the call. Knowing thenumber of required bits, the process proceeds to step 574 where theprimary site generates inbound and outbound ordered bit loading tables.From the inbound and outbound ordered bit loading tables, the processproceeds to step 576 and allocates inbound and outbound carrier channelsto the second call request when such carrier channels are available.

FIG. 25 illustrates an alternate logic diagram for establishing aninfrastructure to support a call. At step 580, the primary sitereceives, via an inbound carrier channel, a digital information transferrequest. For the purposes of this discussion, the digital informationtransfer request may be a request for transmission of digital audioinformation, digital video information, data files, a one-way RFcommunication, a two-way RF communication, or any other type ofconveyance of digital information the communication system can support.

At step 582 the process determines the particular type of digitalinformation being requested. Having determined the type of digitalinformation, the process proceeds to step 584 where the primary siteidentifies at least one carrier channel of a plurality of carrierchannels to function as an outbound transmission path for this digitalinformation transfer. The primary site selects the carrier channel basedon the type of digital information being requested and a carrier channelin use database, or carrier channel allocation information database.Allocation of carrier channels will be discussed in greater detail withreference to FIGS. 26-29.

Having allocated carrier channels for the outbound transmission path,the process proceeds to step 586 where the primary site determinestarget sites. The target sites are the sites that have a subscriberaffiliated therewith and where that subscriber is targeted to receivethe requested digital information. Typically, the digital informationtransfer request will include the type of data being requested and theidentity of the targeted subscribers. Thus, the primary site can readilydetermine the target sites given the identity of the targetedsubscribers by accessing a subscriber unit-location database. Such adatabase is well known in the RF communication system art, thus nofurther discussion will be presented except to further illustrate thepresent invention.

At step 588, the primary site transmits the identity of carrier channelsfunctioning as the outbound transmission path to the target sites via anoutbound control channel. Recall that the outbound control channel isone, or more, of the plurality of carrier channels which has beendedicated to function as the outbound control channel. At step 590, theprimary site transmits, via the outbound transmission path, therequested digital information to the target sites. At step 592, thetarget sites route the requested digital information to the targetedsubscribers. At step 594, the process updates the carrier channel in usedatabase to include the allocation of the carrier channels to theoutbound transmission path. Note that the updating of the carrierchannel in use information may be done simultaneously with step 584.

FIG. 26 illustrates a method for allocating a carrier channel to aparticular call. This process assumes that the call bit loading tablehas already been established. Recall that the call bit loading channelis a compilation of the lowest bit loading of each carrier channel froma plurality of site bit loading tables. Given this, the process beginsat step 600 by determining the number of bits required for theparticular call. Recall that the required number of bits may bedetermined by accessing a call type and required bits database. Forexample, a 64 Kbps digital audio transmission requires 16 bits perframe.

Having identified the number of required bits, the process proceeds tostep 602 where the process scans the call bit loading channel to find aclosest match carrier channel. For the purposes of this discussion, aclosest match carrier channel is one that has a bit loading most closelymatching the number of required bits. At step 604, the bit loading ofthe closest match carrier channel is compared to the number of requiredbits. If the bit loading of the closest match carrier channel is lessthan or equal to the number of required bits, the process proceeds tostep 606 and allocates the closest match carrier channel to theparticular call.

When the bit loading of the closest match carrier channel is less thanthe number of required bits, a remaining number of required bits iscalculated by subtracting the bit loading of the closest match carrierchannel from the number of required bits. Next, the call bit loadingtable is scanned to find a second closest match carrier channel for theremaining number of required bits. If the bit loading of the secondclosest match carrier channel is less than or equal to the remainingnumber of required bits, the process allocates the second closest matchcarrier channel to the particular call. If the bit loading of the secondclosest match carrier channel is less than the remaining number ofrequired bits, a second remaining number of required bits is determinedby subtracting the bit loading of the second closest match carrierchannel from the remaining number of required bits. This processcontinues in this loop until the bit loading of the next closest matchcarrier channel is greater than or equal to the last remaining number ofrequired bits.

When the bit loading of the closest match carrier channel, or the nextclosest match carrier channel, is greater than the number of requiredbits, the process proceeds to step 608 and adjusts the bit loading ofthe closest match carrier channel, or the next closest match carrierchannel, is adjusted to equal the number of required bits, or remainingnumber of required bits. Having done this the process proceeds to step610 wherein the adjusted closest match carrier channel is allocated tothe particular call. Note that the closest match carrier channel isbeing adjusted to match the number of required bits such that onlyrelevant data is being transmitted. As an alternative to adjusting thebit loading of the closest match carrier channel, the primary site couldinject null data into the excess bits, i.e., the bits which exceed thenumber of required bits.

FIG. 27 illustrates an alternate method for allocating a carrier channelto a particular call request. At step 620, the primary site receives acarrier channel allocation request, wherein the carrier channelallocation request may request allocations of outbound carrier channelsseparately or with inbound carrier channels for a particular call.Having received the carrier channel allocation request, the processproceeds to step 622, where the primary site determines the type ofservice being requested from the carrier channel allocation request. Thetype of service being requested may be transfer of digital audio,digital video, establishing a one-way wireless communication path,establishing a two-way wireless communication path, or any other servicethat may be supported by a communication system.

At step 624, a service type-to-bit requirement database is accessed todetermine the number of required bits for this particular requestedservice. For the purposes of this discussion, the service type-to-bitrequirement database stores, for a particular service, the number ofbits required per frame. The number of bits per frame is calculatedbased on a data rate requirement of the requested service and theoperating rate of the infrastructure. For an infrastructure that usesADSL technology, the number of required bits equals the data raterequirement divided by 4,000 (the frame rate for ADSL). Thus, for aservice having a 64 Kbps data rate requirement, the number of requiredbit will require 16 bits per frame (64,000/4,000=16).

At step 626, the primary site generates an ordered bit loading tablebased on the carrier channel allocation request. Recall that an orderedbit loading table is a compilation of target site bit loading tablesthat includes available carrier channels ordered in a given manner.Determination of the target sites is performed by the primary site byinterpreting the request to identify targeted subscribers. From thetargeted subscribers, the primary site accesses a subscriber-locationdatabase to determine the sites having the targeted subscribersaffiliated therewith.

At step 628, the primary site scans the ordered bit loading table todetermine whether the number of required bits exceeds the bit loading ofa first channel carrier having a maximum bit loading. At step 630, theprocess determines whether the bit loading of the first carrier channelexceeds the number of required bits. When it does, the process proceedsto step 638, where the primary site allocates the first carrier channelto the particular request. Having made this allocation, the processproceeds to step 640 and calculates a remaining number of required bitsbased on the number of required bits and the bit loading of the firstcarrier channel. As an example, assume that the number of required bitsis 30 and the bit loading of the first carrier channel is 14 bits. Theremaining number of required bits (16) is determined by subtracting thebit loading (14) from the number of required bits (30).

Having determined the remaining number of bits, the process proceeds tostep 642, where the primary site scans the ordered bit loading table fora second carrier channel having the next maximum bit loading. Note thatwhen a carrier channel is allocated to the particular call it is flaggedwithin the ordered bit loading table, such that it will not bereallocated.

At step 644, the primary site determines whether the maximum bit loadingof the next available carrier channel is less than the remaining numberof required bits. If the remaining number of bits exceeds the bitloading of the next carrier channel, the process proceeds to step 646where the primary site allocates the next carrier channel to theparticular call request. Having done this, the process repeats at steps640 through 644 until the remaining number of required bits is less thanthe bit loading of an available carrier channel having a maximum bitloading. Continuing with the example of step 640, where the number ofrequired bits is 30 and the first carrier channel has a bit loading 14bits, the first remaining number of required bits is 16. Assume that thebit loading of the next carrier channel is 13 bits such that the secondremaining number of bits is 3 (16-13=3). Further assume that the carrierchannel having the next maximum bit loading has a bit loading of 12bits. Thus, the condition for the "do loop" has been met and the processmoves on to step 632.

At step 632, which may be arrived at from a negative decision at step630 or a positive decision at step 644, the process determines a closestmatch carrier channel. The primary site determines the closest matchcarrier channel by scanning the ordered bit loading table to find acarrier channel that has a bit loading that matches, or most closelymatches, the number of required bits or remaining number of requiredbits. For example, with the example given above, the last remainingnumber of required bits is 3. Thus the first carrier channel as scanningdown the ordered bit loading table that has a bit loading of 3 will beallocated to the particular call. If not, a carrier channel having a bitloading greater than three but as close to 3 as possible, i.e., acarrier channel having a bit loading of 4 bits, will be allocated.

At step 634, the bit loading of the closest match carrier channel isadjusted if needed. As mentioned in the preceding example, when theclosest match carrier channel has a bit loading of 4 bits but only 3bits are required, the bit loading of the particular carrier channel isadjusted down to the 3 bits. Having made this adjustment, the processproceeds to step 636 where the closest match carrier channel isallocated to the particular request. As an alternative to bit reducingthe bit loading of the carrier channel, the excessive bits may be filledwith null information or the excessive bits may be used for another callrequest.

FIG. 28 illustrates a logic diagram that may be used to generate anordered bit loading table. At step 650, the primary site determinestarget sites from a channel allocation request. Recall that target sitesare sites that have a targeted subscriber unit affiliated therewith.Having determined the target site, the process proceeds to step 652 andaccesses a site bit loading database to obtain site bit loading tablesfor each of the target sites. Having done this, the process proceeds tostep 654 and accesses a carrier channel in use database, or carrierchannel allocation database, to determine a plurality of availablecarrier channels. Having gathered this information, the process proceedsto step 656 where, for each carrier channel of the plurality ofavailable carrier channels, a comparison is made between the bit loadingin each of the site bit loading tables of the target sites. From thiscomparison, the lowest bit loading value, for each carrier channel, isstored in a call bit loading table, which is depicted at step 658.

Having compared the bit loading of each carrier channel entry in thesite bit loading tables, the process proceeds to step 660 where theprimary site orders the carrier channel entries in the call bit loadingtable to produce the ordered bit loading table. The ordering of the bitloading table may be done to simulate how an ADSL encoder and decoderfunction. For example, in a typical ADSL encoder, the encoder allocatesdata to carrier channels having the largest number of bit loading beforeallocating data to carrier channels having lower bit loading. Thus, theordered bit loading table will generally be ordered from the carrierchannel having the largest bit loading to the carrier channel having thelowest bit loading.

FIG. 29 illustrates an alternative method for allocating carrierchannels to call requests in the system as shown in either FIG. 8 orFIG. 9. At step 670, the primary site obtains a carrier channelallocation request. The request may be obtained by generating therequest within the primary site, or may be received from an externalsource. An external source may be one of the plurality of sites or froma system manager. Regardless of how the carrier channel allocationrequest is obtained, the process proceeds to step 672 where the processdetermines a number of required bits. As previously mentioned, theprimary site determines the number of required bits by accessing a calltype-to-bit requirement database.

At step 674, the primary site accesses an ordered bit loading table toobtain bit loading for each carrier channel. The ordered bit loadingtable may be generated as previously described with reference to FIG.28. Having obtained the bit loading for each carrier channel, theprocess proceeds to step 676, wherein the process sums the bit loadingof the carrier channels to obtain a number of available bits. At step678, the process compares the number of required bits with the number ofavailable bits calculated in step 676. As step 680, the process branchesdepending on whether the comparison of step 678 was favorable, afavorable comparison occurs when the number of available bits matches orexceeds the number of required bits.

If the comparison at step 680 was unfavorable, the process proceeds tostep 682 where the process queues or denies the request and transmits asystem busy or denied message to the requesting subscriber. If, however,the comparison was favorable, the process proceeds to step 684 where theprocess determines whether the number of required bits equals the bitloading of a carrier channel. This determination is done by scanning theordered bit loading table to see if the bit loading of any of thecarrier channels matches the number of required bits. If the scan findsa match, the process proceeds to step 686 where the process allocatesthe carrier channel having the bit loading which matches the number ofrequired bits to the carrier channel request. If, however, a match isnot found in step 684, the process proceeds to step 688 where adetermination is made as to whether the number of required bits isgreater than the bit loading of a carrier channel having the maximum bitloading in the ordered bit loading table.

When the answer to the comparison to step 688 is no, at step 690, theprocess compares the bit loading of each carrier channel with the numberof required bits to find a closest match carrier channel. A closestmatch carrier channel is one that has bit loading greater than thenumber of required bits, but is closest to the number of required bits.For example, if the number of required bits is 4 and the only twocarrier channels available have a bit loading of 6 bits and 8 bits, thecarrier channel having the bit loading of 6 bits will be the closestmatch. At step 692, the process adjusts the bit loading of the closestmatch carrier channel to equal the number of required bits, anadjustment message is generated, and the closest match carrier channelis allocated to the call request.

Adjusting the bit loading of the closest match carrier channel is doneby changing the bit loading to match the number of required bits, thusin the mini example presented above, the carrier channel having a bitloading of 6 bits will be adjusted to 4 bits. This adjustment is used toprevent unnecessary data being transmitted. As one skilled in the artcan readily appreciate, this adjustment may be alleviated by injectingnull information into the extra 2 bits. If such an approach is taken, anull indication is generated such that the receiving end knows whichparticular bits are carrying the null information. Alternatively, theextra two bits could be used to carry data for another data transferrequest.

When the number of required bits is greater than the bit loading of anycarrier channel, at step 694, the process allocates the carrier channelhaving the maximum bit loading, i.e., the maximum carrier channel, tothe carrier channel request. Having done this, the process proceeds tostep 696 where the process determines a remaining number of requiredbits from the number of required bits and the bit loading of the maximumcarrier channel. As an example, the remaining number of required bitsmay be determined by subtracting the bit loading of the maximum carrierchannel from the number of required bits.

At step 698, the process determines whether the remaining number ofrequired bits equals the bit loading of any available carrier channel.If yes, the process proceeds to step 700 where the particular carrierchannel is allocated to the carrier channel request. Having done this,the particular carrier channel allocation request has been allocated asufficient number of carrier channels to fulfill the bandwidthrequirements of the service being requested. Thus, concluding theprocess for this particular carrier channel allocation request.

If, however, the remaining number of bits does not equal the bit loadingof a carrier channel the process proceeds to step 702 where the processdetermines whether the remaining number of bits is greater than the bitloading of any available carrier channel. If the answer is yes, theprocess reverts back to step 694 where the carrier channel having themaximum bit loading is allocated to the particular carrier channelrequest then a second remaining number of required bits is calculated.

If, however the remaining number of required bits is less than the bitloading of a carrier channel having a maximum bit loading the processproceeds to step 704. At step 704, the bit loading of each carrierchannel is compared with the remaining number of required bits to find aclosest match carrier channel. Having found a closest match carrierchannel, the process proceeds to step 706 where a determination is madeas to whether the remaining number of required bits is equal to 1. Ifthe answer to step 706 is no, the process proceeds to step 708 where theclosest match carrier channel has its bit loading adjusted to match theremaining number of required bits and the closest match carrier channelis allocated to the carrier channel allocation. Having done this, thecarrier channel allocation request has been supplied with a sufficientnumber of carrier channels to meet the bandwidth requirements for thecall.

If, however, the remaining number of required bits is equal to 1, theprocess proceeds to step 710 where an inquiry is made as to whether anyof the allocated carrier channels has a bit allocation greater than 3.If not, the process proceeds to step 712 where the request is denied.If, however, the answer to step 710 is yes, the closest match carrierchannel has its bit loading adjusted to 2 bits and a previouslyallocated carrier channel has its bit loading reduced by 1 bit. Forexample, assume that an allocation to a particular request has alreadyallocated a carrier channel having a bit loading of 7 bits. A remainingnumber of bits is calculated to be 1, a closest match carrier channel isfound to have 3 bits. Thus, the closest match carrier channel will haveits bit loading adjusted to 2 bits and the bit loading of the previouslyallocated carrier channel will have its bit loading reduced to 6 bits.

The previous step is required due to ADSL requirements. Per the ADSLrequirements, the minimum bit loading a carrier channel can have is 2bits. With two bits, the quadrature amplitude modulation (QAM) signalgenerated from the two bits will have a single constellation point ineach quadrant. Having one constellation point in each quadrant is theminimum amount of constellation points that a QAM signal can represent.

FIG. 30 illustrates a logic diagram that may be used to perform carrierchannel allocation updates. At step 720, the primary site receivesupdated bit loading information from a plurality of sites. In an ADSLsystem, bit loading information is updated on a regular basis. Typicallyupdating occurs every 69th frame by transmitting a training signal tothe plurality of sites. The frequency in which the updating needs totake place may be adjusted based on the environment in which the twistedpair copper wire telephone line exists. For example, the transfercharacteristics of the twisted pair copper wire telephone line changedue to temperature, wind, humidity, and other environmental variations.

Having received the updated bit loading information from the pluralityof sites, the process proceeds to step 722 where, for each active call,an updated call bit loading table is determined. As previously mention acall bit loading table is a compilation of site bit loading tableswherein the site bit loading tables are determined by the particularsites having a target unit located within their boundaries. Thus, theprocess at step 722 is a similar process as described above other thanthe function at step 722 utilizes the updated bit loading informationfrom the sites obtained in step 720.

Having generated the updated call bit loading tables, the processproceeds to step 724 where the primary site determines whether thecurrent carrier channel allocation for the particular call providessufficient bandwidth. This determination is made by comparing theupdated bit loading of the carrier channel(s) allocated to a particularcall with the previous bit loading of the carrier channel(s). If the bitloading for the allocated carrier channels remain the same or increase,the answer to step 724 will be yes. If, however, the bit loading goesdown, the answer to step 724 is no.

As an example, assume that two carrier channels have been allocated to aparticular call. The bit loading for these two carrier channels is 7bits and 6 bits, respectively, and the bandwidth requirements is 13bits. After a bit loading update, the bit loading of these two carrierchannels has changed to 8 bits and 5 bits, respectively. Thus, thebandwidth requirements are still met even though the distribution of thedata will be different. If, however, the updated bit loading for the twocarrier channels is 7 bits and 5 bits, respectively, the current carrierchannel allocation does not provide sufficient bandwidth.

If the answer to step 724 was yes, the process proceeds to step 726where, for a carrier channel having a bit loading increase, bitreduction data is adjusted within the carrier channel allocationdatabase. For the purposes of this discussion, the bit reductioninformation indicates the number of bits that a carrier channel has beenreduced to match the bandwidth requirements. For example, a carrierchannel has a bit loading of 12 bits, but, the call bandwidthrequirements only needs 10 bits. Thus, in the carrier channel allocationdatabase, the bit loading of the carrier channel will be adjusted to 10bits and the bit reduction data will be 2 bits.

If the answer to the inquiry of step 724 was no, the process proceeds tostep 728. At step 728, an inquiry is made as to whether addition carrierchannel resources are available. Addition carrier channel resources maybe in the form of available carrier channels or available bits due to aprevious bit reduction. If the answer to the inquiry of step 728 is yes,the process proceeds to step 730 wherein the current carrier channelallocation is modified to meet the bandwidth requirements. This may bedone by adjusting the bit loading of allocated carrier channels or byallocating addition carrier channels to the call. If, the modificationis done by adjusting the bit loading of allocated carrier channels, thebit reduction information is added to the bit loading of the carrierchannel to generate new bit loading information and the bit reductiondata is reduced to zero. For example, assume that one carrier channelwas allocated to a particular call and the carrier channel has anadjusted bit loading of 10 bits and a bit reduction of 2 bits. After anupdate, the bit loading of the channel was reduced to 10, thus the 2bits of bit reduction would be deleted to meet the required bandwidth.

If the answer to step 728 was no, the process proceeds to step 732 wherean inquiry is made as to whether the particular call is a controlchannel. If the answer to step 732 is no, the process proceeds to step738 where the call is queued until carrier channel resources becomeavailable, or the call is terminated.

If, however, the answer to step 732 is yes, the process proceeds to step734. At step 734, a low priority call is pre-empted to produce availablecarrier channel resources. Having made carrier channel resourcesavailable, these carrier channel resources are allocated to the controlchannel, which is depicted at step 736.

FIG. 31 illustrates a logic diagram for producing an updated call bitloading table. At step 730, updated bit loading information is receivedas either new site bit loading tables or as a bit loading changemessage. As indicated by this inquiry, the updated bit loadinginformation may be received as new site bit loading tables, wherein asite, after receiving the update training signal, transmits a new, orupdated, site bit loading table to the primary site. Alternately, thesite could compare the new bit loading table with the previous bitloading table for any differences. When the site detected a difference,the site generates a change message indicating which carrier channelshad a bit loading change and the type of change. Having done this, thesite sends the change message.

When the bit loading information is transmitted as a change message, theprocess proceeds to step 732 where the primary site creates an updatedsite bit loading table from the change message. This is accomplished bytaking the existing site bit loading table and interpreting the changemessages to create the updated site bit loading table. Having done thisthe process proceeds to step 734.

At step 734, a site location database is accessed to determine whichsites are supporting a current call to produce a set of sites. Theprocess then proceeds to step 736 wherein, for each carrier channelentry in the set of sites bit loading tables, the lowest bit loading isdetermined. Thus, if a call is being supported by three sites andcarrier channel 1 has a bit loading of 12 bits in site 1, 11 bits insite 2, and 13 bits in site 3, the lowest bit loading for carrierchannel 1 is 11 bits. This 11 bits will be entered into the updated callbit loading table. This is depicted at step 738, wherein the lowest bitloading for a particular carrier channel is entered into the updatedcall bit loading table. Next, the process proceeds to step 740 whereeach of the particular carrier channels in the set of site bit loadingtables are compared to determine the lowest bit loading. Then, thelowest bit loading is entered into the updated call bit loading table.Once each of the carrier channels has been compared, the update call bitloading table is complete.

FIG. 32 illustrates an alternative embodiment for updating carrierchannel allocations. At step 742, the process accesses a carrier channelallocation database to determine bit loading requirements for aparticular call. Having obtained this information, the process proceedsto step 744 where the carrier channel allocation database is againaccessed to identify at least one carrier channel. Having done this, theprocess proceeds to step 746, wherein bit loading of the at least onecarrier channel is determined from the updated call bit loading table.With this information, a comparison is made at step 748 to determinewhether the bit loading of the carrier channel is greater than or equalto the bit loading requirements.

If the bit loading of the carrier channel indicated in the updated callbit loading table is greater than or equal to the bit loadingrequirements, the process proceeds to step 752 where the processindicates that the current carrier channel allocation providessufficient bandwidth. In other words, when the bit loading remains thesame or increases for the allocated carrier channel, the bandwidthrequirements are met, thus the carrier channel provides sufficientbandwidth. Having made this determination the process proceeds to step754.

At step 754, the process first determines whether the bit loading of theallocated carrier channel increases, or is greater than the bitrequirements. If not, the process is complete for this updating process.If, however, the bit loading has increased, the carrier channel's bitloading is adjusted to met the bandwidth requirements. In addition, thebit reduction data is updated to indicate the number of bits theallocated carrier channel has been reduced. Having done this, theprocess proceeds to step 756 where the carrier channel allocationdatabase is updated with the carrier channel's bit loading and bitreduction data.

If the updated bit loading of the carrier channel is less than the bitloading requirements, the process proceeds to step 750 where it isdetermined that the current carrier channel allocation does not providesufficient bandwidth. In other words, when the bit loading of theallocated carrier channel is reduced as a result of the updating, thecarrier channel cannot support the bandwidth, or meet the bitrequirement of the particular call. Having made this determination, theprocess proceeds to step 758.

At step 758, the process accesses the carrier channel allocationdatabase to determine bit reduction data for the at least one carrierchannel. This is done to determine whether the previous bit loading ofthe carrier channel had been bit reduced to match the bandwidthrequirements for the call. Note that when the updated call bit loadingtable is generated, the bit loading for a carrier channel will be themaximum bit loading for that carrier channel less the number of bitsindicated by the bit reduction data. For example, assume that initiallya carrier channel had a bit loading of 12 bits. The bandwidthrequirement for the particular call it is supporting is only 10 bits.Thus, the bit loading in the call bit loading table would be 10 bits andthe bit reduction data would be 2 bits. When the carrier channel bitloading is updated, it is determined that its new maximum bit loading is10 bits. When the call bit loading table is updated, it will be updatedto 8 bits (10 minus 2) due to the 2 bits in the bit reduction field ofthe carrier channel allocation database.

Having accessed the carrier channel allocation database at step 758, theprocess proceeds to step 760 where it is determined whether the bitreduction data is greater than or equal to 1 bit. If the bit reductiondata is greater than or equal to 1, the process proceeds to step 762where the bit reduction data is added to the bit loading of the carrierchannel to get further updated bit loading information. Having generatedthe updated bit loading, the process proceeds to step 764 where it isdetermined whether the updated bit loading is greater than or equal tothe bit loading requirements.

If the updated bit loading is not greater than or equal to the bitloading requirements, or the bit reduction data is 0 bits, the processproceeds to step 770 where a determination is made to identify a bitloading difference. The bit loading difference can be determined bysubtracting the current bit loading capabilities of the carrier channelfrom the bit loading requirements. At step 772, the process determineswhether the bit loading difference is greater than 1. If the bit loadingdifference is greater than 1, the process proceeds to step 774 whereanother carrier channel is allocated to the current call. Having donethis, the carrier channel allocation database is updated.

If, however, the bit loading difference as determined in step 772 is notgreater than 1, the process proceeds to step 776. At step 776, anothercarrier channel having a bit loading of at least 2 bits is allocated tothe particular call. Having done this, the previously allocated carrierchannel has its bit loading reduced by 1. Having reduced the bit loadingby 1, the bit reduction data for this carrier channel is updated.

When the updated bit loading is greater than or equal to the bit loadingrequirements as determined at step 764, the process proceeds to step766. At step 766, the bit loading of the carrier channel is set equal tothe bit loading requirements. Having done this, the process proceeds tostep 768 where the bit reduction data is updated to reflect the numberof bits the bit loading has been reduced and this value is stored in thecarrier channel allocation database.

FIG. 33 illustrate a logic diagram that may be used for updating carrierchannels that have been allocated to a control channel. At step 780,updated bit loading information is obtained from a plurality of sites.Having obtained this information the process proceeds to step 782 wherean updated control channel bit loading table is determined. Recall thata control channel bit loading table is a compilation of all of the sitebit loading tables wherein the control channel bit loading table storesthe lowest bit loading for each carrier channel.

At step 784, the process determines whether the current carrier channelallocation for the control channel had a total bit reduction. A totalbit reduction is determined by summing the bit loading for each carrierchannel allocated to the control channel. If a total bit reduction didnot occur, the process proceeds to step 786 where an inquiry is made asto whether the control channel can be fulfilled with fewer carrierchannels. This determination is based on comparing the bit loading ofthe allocated carrier channels to the control channel in comparison tothe number of required bits for the control channel. If the bit loadingof one of the carrier channels can be removed and the bit requirementsfor the control channel can be met, then the control channel can befulfilled with fewer carrier channel.

If the control channel cannot be fulfilled with fewer carrier channels,the process proceeds to step 790. At step 790, the current carrierchannel allocations are maintained and bit loading may be adjustedaccordingly. Note that the bit loading may be adjusted to meet thebandwidth requirements and, if done, the bit reduction will be stored ina carrier channel allocation database.

When the current carrier channel allocation for the control channel hasundergone a bit reduction, the process proceeds to step 792. At step792, an inquiry is made as to whether any of the carrier channelsallocated to the control channel have bit reduction data greater than 0.In other words, the inquiry at step 792 determines whether a carrierchannel allocated to the control channel had its bit loading reduces tomatch the bandwidth requirements. If the inquiry to 792 is yes, theprocess proceeds to step 800. At step 800, the bit loading of theparticular carrier channel is increased by the bit reduction data.Having done this, the process proceeds to step 802, where an inquiry ismade as to whether the bit loading increase provides sufficient bitloading to meet the bit requirements. If the answer to 802 is yes, theprocess proceeds to step 804 where the carrier channel allocationdatabase is updated to reflect the change.

If the answer to step 792 or the answer to step 802 is no, the processproceeds to step 794. At step 794 an inquiry is made as to whetheranother carrier channel is available. If yes, the process proceeds tostep 795 where the other carrier channel is allocated to the controlchannel and the carrier channel allocation database is updated toreflect this change. If, however, another carrier channel is notavailable the process proceeds to step 796.

At step 796, a low priority call is terminated to produce an availablecarrier channel. Prioritization of calls has not been discussed in greatdetail, but to one skilled in the art, prioritization is a well knowntechnique. Thus, a detailed description of call prioritization is notnecessary for the understanding of this invention.

Having terminated a low priority call, the process proceeds to step 798where the carrier channel made available is allocated to the controlchannel. Having made this allocation, the carrier channel allocationdatabase is updated.

FIG. 34 illustrates a function block diagram of a discreet multi-tonetransmitter. As shown, a stream of data entries 802, which includes aplurality of data entries 804, is received by a data formatter 806. Inaddition to receiving the data stream 802, the data formatter alsoreceives carrier channel allocation information 810. From the datastream 802, the data formatter produces an ordered data stream 808 basedon the carrier channel allocation information 810. The ordered datastream 808 is then received by a discreet multi-tone encoder 812, whichalso receives bit loading information 816. Based on the bit loadinginformation 816, the discrete multi-tone encoder 812 produces an encodeddata stream 814.

The illustration of FIG. 34 depicts a system having only ten carrierchannels. In a typical ADSL system, however, there are 256 carrierchannels, or separate frequencies. The present invention contemplatesusing the ADSL system techniques, nevertheless, for the sake ofillustration, the remainder of the discussion for this figure will dealwith a system having only ten carrier channels. As shown, the datastream 802 includes an outbound carrier channel data entry, a first dataentry, a second data entry, and a third data entry. The order in whichthe data entries are placed in the data stream are determined uponreceipt of the calls or some other determination mechanism. Thisdetermination is made by the TDMA switch of FIGS. 10 and 11, wherein theTDMA switch produces the data stream 802. Note that the data stream 802is shown with a number under each data entry, where the numberrepresents the number of required bits per frame. Thus, the outboundcontrol channel requires 22 bits, while the first data entry requires 8bits, the second data entry requires 16 bits, and the third data entryrequires 32 bits.

The carrier channel allocation information table 810 includes a carrierchannel field 818, a bits field 820, an allocation field 822, and anaddress pointer field 824. The generation of the address pointerinformation will be described later with reference to FIGS. 46-50. Asshown, carrier channel 1 and carrier channel 2 each have a bit loadingof 11 bits and are allocated to the outbound control channel. Carrierchannel 7 is allocated to data entry, or call, 1. Carrier channels 6 and9 are allocated to data entry, or call, 2. Carrier channels 0, 3, 4, and5 are allocated to data entry, or call, 3. The determination of carrierchannel allocation was done in accordance with the logic diagrams ofFIGS. 26-29.

The data formatter 806 utilizes the carrier channel allocationinformation 810 to generate the order data stream 808. The ordered datastream 808 is needed to insure that the discrete multi-tone encoder 812will affiliate the appropriate portions of the data entries with theallocated carrier channels. For example, as mentioned, carrier channels1 and 2 have been allocated to the outbound control channel. Thediscreet multi-tone encoder 812, assuming a constellation encodingpattern of loading data into a carrier channel having the greatest bitloading to carrier channels having the smallest bit loading, will placethe data it receives in the carrier channels having the largest bitloading first. Thus, as shown in the carrier channel allocationinformation table 810, the first carrier channel that the discretemulti-tone encoder will place data in is carrier channel 1. Havingfilled carrier channel 1, the encoder will then sequentially fillcarrier channels 2, 6, 4, etc.. Thus, the data formatter 806 mustorganize the data stream of data entries 802 into the ordered datastream such that the data blocks of the data entries will be affiliatedwith the appropriate carrier channel.

While the discreet multi-tone encoder 812 will load particular carrierchannels based on their bit loading, the encoded data stream will beorganized in a sequential manner based on the bit loading information.The sequential manner is based on the carrier channel numbering. Asshown, the encoded data stream 814 is organized from carrier channel 0to carrier channel 9. The bit loading information informs the DMTencoder 812 as to how much of the ordered data stream is to be placed onto each of the carrier channels. The DMT encoder 812 will essentiallyused the ADSL encoding scheme, thus no further discussion will bepresented except to further illustrate the present invention.

FIG. 35 illustrates a more detailed schematic block diagram of the dataformatter 806. As shown, the data formatter 806 includes a dual stagememory 826, an output section 836, a read address generation unit 828, awrite address generation unit 830, a first multiplexer 834, and a secondmultiplexer 832. The dual stage memory 826, which may be Manchesterencoder, includes a first stage 838 and a second stage 840. The outputsection 836 includes an adder 844 and an AND gate 846.

In operation, the data stream of entries 802 are received in a shiftright serial manner into the data input port of either the first stage838 or the second stage 840 and read out in the ordered data stream 808.The controller 110, which may be the controller within the primary siteor any one of the secondary sites as illustrated in FIG. 10 or 11,provides a read-write signal 842, an enable signal 848, and addresspointer information 850 to the data formatter 806. The read-write signal842 indicates which of the stages of the dual stage memory 826 will beproviding the ordered data stream 808 and which will be storing the datastream 802. In addition, the read-write signal 842 enables themultiplexers 834 836 to provide the addresses generated by the read AGU828 or the write AGU 830 to the first or second stage of the dual stagememory 826. The read-write signal 842 is toggled on a frame cycle basis.In other words, for one frame (250 μSec for an ADSL frame) theread-write signal 842 is providing a logic "1" signal to the secondstage 840 and to multiplexer 832, such that the second stage 840 is inthe read mode and receiving addresses from the read AGU 828. During thisframe cycle, an inversion of the read-write signal 842 (logic "0") isprovide to the first stage 838 and multiplexer 834 such that the firststage is in the write mode and receiving addresses from the write AGU.For the next frame cycle, the read-write signal provides a logic "0"signal such that the second stage is now in the write mode while thefirst stage is in the read mode. To one skilled in the art, the logicvalue of the read-write signal may be altered and still achieve thedesired results.

The address pointer information 850 is used by the read AGU to allow thestages to be read out in a fragmented manner to produce the ordered datastream. This will be discussed in greater detail below with reference toFIG. 62. Alternatively, the address pointer information 850 could beutilized by the write AGU 830 to write in the information in a staggeredmanner, such that the data stream 802 is stored as the ordered datastream 808 and serial read out. Generation of the address pointerinformation 850 will be discussed below with reference to FIGS. 48-50.

Note that the data formatter 806 is clocked at a rate of 15.36 MHz. Thisfrequency is chosen based on the maximum bit rate for an ADSL system.(Note that the clock rate may be chosen to be a different valuedepending on the needs of the system, or the clock rate may be variablebased on the data rate.) Recall that an ADSL system has 256 carrierchannels, with each carrier channel being able to carry up to 15 bits.Also recall that the ADSL frame rate, or frame cycle, is 4 KHz. Thus,the maximum bit rate is 256*15*4K which equals 15.36 M. While themaximum bit rate is 15.36 Mbps, the practical maximum bit rate will be 6Mbps to 9 Mbps based on the gauge of wire used and the length of wire.Thus, there will be a sufficient number of clocks cycles in which nodata is being stored or sourced. To prevent dataless entries into theordered data stream 808, the controller 110 provides the enable signal848 to the output section 838 and the read AGU 828. The enable signal848 is logic "1" when actual data is being read from the dual stagememory 826 and a logic "0" thereafter for a frame cycle. For example, ifbits are read from the dual stage memory 826 in a serial manner andthere are 1,000,000 bits of data stored, the enable signal will be logic"1" for the first 1,000,000 clock cycles within a frame cycle and willbe logic "0" for the remaining 14,360,000 clock cycles of the framecycle. Thus, to one skilled in the art, the enable signal 848 may begenerated by a variety of digital circuits, such as a counter and latch,a sub-routine within a microprocessor, etc.

In operation, the write AGU 830 produces a circular buffer addressingscheme wherein the bits of the data stream 802 are serially shiftedright into the first or second stage 838 840, depending on which stageis in the write mode. Thus, the first bit in the data stream 802 will bestored in the first storage location of either the first stage 838 orthe second stage 840. The next bit in the data stream 802 will be storedin the second storage location, the third bit in the third storagelocation, and so on until all of the bits of the data stream 802 havebeen stored for this frame cycle.

Once a frame's worth of data has been stored, the write AGU 830 resets,or circles around, such that, for the next frame, the write AGU 830provides the same addresses in the same order as it did for the previousframe. Note that the enable signal 848 may also be provided to the writeAGU 830, such that, when all the bits of a frame of the data stream 802has been stored, the write AGU 830 stops generating addresses for thisframe.

The read AGU 828 provides addresses to the first or second stage,depending on which stage is in the read mode, in a staggered manner. Thestaggered manner is determined based on the address pointer information850 such that the data is read out as the ordered data stream. Toillustrate, refer back to FIG. 34. As shown in FIG. 34, the carrierchannel allocation information 810 includes an address pointer field824. The address pointer information 850 indicates the beginning addressfor a data block of a data entry 804 of the data stream 802. From thecarrier channel allocation database 810, it can be seen that the dataentry 804 entitled outbound control channel is allocated carrierchannels 1 and 2; the first data entry is allocated carrier channel 7;the second data entry is allocated carrier channels 6 and 9; and thethird data entry is allocated carrier channels 4, 0, 3, and 5.

For each data entry that is allocated two or more carrier channels, thedata entry is divided into data blocks, where the number of data blocksequals the number of allocated carrier channels. Further note that theordering of the data blocks is based on the bit loading of the allocatedcarrier channels. For example, data entry three is allocated carrierchannels 4, 0, 3, and 5, where carrier channel 4 has the greatest bitloading (10 bits), then carrier channel 0 (9 bits), carrier channel 3 (9bits) and carrier channel 5 (4 bits). Thus, data block "a" of data entrythree is allocated carrier channel 4, data block "b" is allocatedcarrier channel 0, data block "c" is allocated carrier channel 3, anddata block "d" is allocated carrier channel 5.

While data entries are broken down into data blocks for carrier channelallocation, the data entries are stored as data entries, but are readout as data blocks to produce the ordered data stream. As an example ofthis refer to FIG. 62 which illustrates an exemplary process for storingthe transmit data stream 1188 in a write section 1196 of the dual stagememory (826 of FIG, 35) and subsequently reading the stored data toproduce the ordered data stream 1198. As shown, the data stream 1188comprises a plurality of transmit data entries. In particular, outboundcontrol channel, data call 1, data call 2, and data call 3. During thewrite cycle 1190, which comprises a shift right operation, the dualstage memory sequentially stores the first data entry followed by datacall 1, data call 2, and data call 3.

From the carrier channel allocation table 1192, it can be seen that onlydata call 1 is allocated a single carrier channel. The other dataentries are allocated two or more carrier channels and, as a result, arebroken down into data blocks 1194. As shown, the outbound controlchannel data entry has two data blocks, wherein the first data block isallocated carrier channel 1 and the second data block is allocatedcarrier channel 2. Data call 1 is allocated carrier channel 7; data call2 has two data blocks, where the first data block (2a) is allocatedcarrier channel 6 and the second data block (2b) is allocated carrierchannel 9; and data call 3 has four data blocks, where data block 3a isallocated carrier channel 4, 3b is allocated carrier channel 0, 3c isallocated carrier channel 3, and 3d is allocated carrier channel 5.Given the data block breakdown and the constellation encoding patternused by a constellation encoder (discussed in FIG. 36 below), theordered data stream 1198 can be generated.

For purposes of this discussion, assume that the constellation encoderloads data into the carrier channels having the largest bit loadingcapabilities first. From the carrier channel allocation database 1192,the carrier channel order, based on greatest bit loading to least bitloading, is 1, 2, 6, 4, 0, 3, 7, 9, 5, and 8. Thus, the first 11 bits ofdata the constellation encoder receives will be placed in carrierchannel 1, the next 11 bits in carrier channel 2, the next 11 bits incarrier channel 6, the next 10 bits of data in carrier channel 4, thenext 9 bits of data in carrier channel 0, and so on. To ensure that thedata blocks are allocated the appropriate carrier channels, the ordereddata stream 1198 supplies the data to the constellation encoder in theright order. Thus, the ordered data stream 1198, for this example,contains, in a serial order, the data affiliated with carrier channel 1first, followed by the data affiliated with carrier channel 2, then 6,4, 0, 3, 7, 9, 5, and 8.

As shown, the first data block that is read from the dual stage memoryduring the read cycle 1200, is the first data block of the outboundcontrol channel data entry. The initial read address for this data blockis set equal to the address pointer for this data block. The readaddress is then incremented at clock cycle intervals up to the number ofbits in the data entry. For the first data block of the outbound controlchannel, this is 11 bits, thus, the read address is incremented 11 timesfrom the address pointer for this data block. Having produced the 11addresses, the read cycle retrieves the address pointer for the dataallocated to the next greatest bit loading carrier channel. In thisexample, the address pointer for the second data block of the outboundcontrol channel is retrieved and addresses are produced to read thisdata block. After this data block has been read, the next data blockaffiliated with the carrier channel having the next greatest bit loadingis read. In this example, that is the first data block of data call 2.This process continues until all the data blocks have been read in anorder based on the bit loading of the respective allocated carrierchannel. For a given frame cycle, the ordered data stream will have anorder of outbound control channel data block "a", outbound controlchannel data block "b", data call 2 data block 2a, data block 3a, 3b,3c, data call 1, 2b, and 3d, which corresponds to the constellationencoding of greatest bit loading to least bit loading carrier channels.

Referring back to the discussion of FIG. 34, the ordered data stream 814is read on a data block basis, while the data stream 802 is stored on adata entry basis. As discussed, the reading of the data is further basedon the constellation encoding scheme used by the constellation encoder.Given, this information, the ordered data stream 808 is produced. Fromthe ordered data stream, the DMT encoder 812, which utilizes theconstellation encoding scheme, generates the encoded data stream 814. Asshown, the encoded data stream is sequentially organized by carrierchannel number, but the data contained within each carrier channel is asdefined in the carrier channel allocation database 810.

While the above discussion focused on storing the data stream 802 on adata entry by data entry basis and reading on a data block by data blockbasis to produced the ordered data stream 808, the process could bereversed. For example, the data stream could be stored on a data blockby data block basis and retrieved in a sequential order to produce theordered data stream 808. Under this approach, the addressing techniquethat was used for the read AGU would now be used for the write AGU.Similarly, the addressing technique that was used for the write AGUwould now be used for the read AGU.

FIG. 36 illustrates an alternate embodiment of a DMT transmitter of FIG.10 or 11. As shown, the DMT transmitter includes an ADSL transmitter 852and a data formatter 806. The data formatter includes an addressgeneration unit 858, memory 856, and an output section 854. The addressgeneration unit provides a first addressing scheme to the memory tostore data and a second addressing scheme to read the data. As mentionedabove, the first addressing scheme may be a circular buffer approach,while the second addressing scheme utilizes the address pointerinformation and the bit loading information such that the data is readout to produce the ordered data stream 808. The output section 854provides the ordered data stream 808 to the ADSL transmitter 852 when anenable signal 848 is active.

The ADSL transmitter 852 includes an input MUX 860, a fast path 862, andinterleave path 864, a constellation encoder 866, a DMT modulator 868,memory that stores a bit loading table 870, and two input ports 872 and874. The first input port 872 allows the ADSL transmitter 852 to receivean ordered data stream 808 and directly provide the data to theconstellation encoder 866. The constellation encoder 866 can then, basedon the bit loading table 870, convert the ordered data stream into anencoded data stream 814 and subsequently covert it into a time domainDMT symbol 876 by the DMT modulator 868. The bit loading information inmemory 870 may be provided from an external source via the second inputport 874.

Up to this point, the data provided to the ADSL transmitter 852, or theDMT encoder 812, has been generated without consideration to errorcorrection. As one skilled in the art will readily appreciate, thedata-formatter 806 may include error correction techniques, to ensure amore reliable data transmission. For example, the data formatter 806 mayinclude a interleave technique, an encryption technique, cycleredundancy checks (CRC), forward error correction, or any other type oferror correction. Note that whatever error correction techniques used bythe data formatter 806, a data de-formatter must include the inverseerror correction techniques.

As an alternative to incorporating error correction into the dataformatter 806, the error correction within the ADSL transmitter 852could be used. In this embodiment, the data formatter 806 would providethe ordered data stream to the inputs of the MUX 860. The data formatter806 would include another layer in creating the ordered data stream 808due to the four T1 inputs of the MUX 860.

FIG. 37 illustrates an ADSL data interface 878 coupled to an ADSLtransmitter 852. As shown the ADSL data interface 878 includes a dataformatter 806, a processor 882, memory 884, and a constellation encodersimulator 886. The memory 884 stores bit loading information, carrierchannel allocation information, and bit loading requirements. The memory884 may also store call type information, call bit requirements, callbit loading tables, and site bit loading tables. The processor 882generates the carrier channel allocation information based on the bitloading requirements and the bit loading information and providescontrol signals to the data formatter 806. Such control signals are theaddress pointer information, the enable signal, and the read-writesignal. Thus, the processor 882 is similar in function as the processorshown in FIGS. 10 and 11, which are included in the controller 110.

The constellation encoder simulator 886 simulates the manner in whichthe constellation encoder of the ADSL transmitter encodes the data. Aspreviously mentioned, the constellation encoder will load the data inthe carrier channel having the largest bit loading first followed bycarrier channels with sequentially less bit loading capabilities. Thus,the constellation encoder provides information to the processor 882indicating the order in which carrier channels will be loaded with data.From this information, an ordered bit loading table may be created suchthat the ordered data stream may subsequently be generated. Note thatthe constellation encoder simulator 886 may be incorporated as part ofthe processor 882, but for the purposes of this drawing, are shownseparate.

FIG. 38 illustrates a logic diagram that may be used to emulate a DMTtransmitter. At step 890, a transmit data stream is received wherein thedata stream includes at least one data entry. Having received the datastream, the process proceeds to step 892 where bit loading informationis received. Next, the process proceeds to step 894 where the processreceives address pointer information for the data stream. From theaddress pointer information, the process extracts data entrypartitioning information and an address pointer for each data entryportion.

At step 896, an ordered data stream is generated from the transmit datastream based on the address pointer information. This may be done bystoring the transmit data stream in a sequential order and reading thestored data based on the data entry partitioning information.Alternatively, the transmit data stream may be stored based on the dataentry partitioning information and read in a sequential order to producethe ordered data stream. Having done this, the process proceeds to step898 wherein an encoded data stream is produced from the ordered datastream based on the bit loading information. Having done this, theprocess proceeds to step 900 where the encoded data stream is convertedinto a discreet multi-tone signal or symbol. Note that the processdescribed above for FIG. 38 is done for each frame.

FIG. 39 illustrates an alternative logic diagram for implementing a DMTtransmitter. At step 902, bit loading information is obtained as eithera site bit loading table or a call bit loading table. A call bit loadingtable, as previously mentioned, is a compilation of a plurality of sitebit loading tables. The manner in which this information is obtained maybe done by receiving it from a controller, or acquiring it by queryingthe secondary sites for bit loading information and compiling the bitloading information. At step 904, a constellation encoding function ofan ADSL transmitter is simulated by arranging carrier channels based onthe bit loading information of each carrier channel and a constellationencoding function. This produces a simulated encoded order of carrierchannels, which may be depicted as an ordered bit loading table. Havingdone this, the process proceeds to step 906 where bit loadingrequirements for the data are obtained by accessing a bit raterequirement data base. The manner in which this data is obtained may bedone by receiving it from a controller within a primary site orsecondary site, or may be generated by receiving data from users of thesystem or from a system manager.

The process proceeds at step 908 where carrier channel allocationinformation is obtained. The carrier channel allocation information maybe received from a controller of a primary site or second site, or maybe individually generated within an ADSL data interface unit. Next theprocess proceeds to step 910 where address pointer information isobtained. Again, this information may be internally generated in an ADSLinterface unit, or received from a controller within a primary site orsecond site. Once all the necessary information has been generated orreceived, the process proceeds to step 912 where an ordered data streamis generated based on the carrier channel allocation information.

FIG. 40 illustrates a functional block diagram of a DMT receiver. TheDMT receiver receives a time domain DMT symbol 876 via a DMT decoder920. The DMT decoder 920 produces a demodulated data stream 922 andsubsequently generates an order data stream 808 via bit loadinginformation 816. The order data stream is then provided to a datadeformatter 924. The data deformatter 924 converts the ordered datastream 808 into a recovered data stream 926 based on carrier channelallocation information 810.

The DMT decoder 920 produces the demodulated data stream 922 from thetime domain DMT signal 876. This is a typical ADSL, or DMT, inversefunction, thus will not be discussed in great detail. In addition, theDMT decoder 920, based on the bit loading information, subsequentlyconverts the demodulated data stream 922 into the ordered data stream808. In essence, the DMT decoder 920 is performing the inverse functionof the DMT encoder 812 (of FIG. 34) to recapture the data supplied tothe DMT encoder of the DMT transmitter (FIG. 34).

Similarly, the data deformatter 924 is performing an inverse function ofthe data formatter 806 of the DMT transmitter (FIG. 34). Thus, by usingthe carrier channel allocation information 810 on the ordered datastream 808, the recovered data stream 926 is obtained. Note that therecovered data stream 926 is identical to the data stream 802 inputtedinto the data formatter 802 of the DMT transmitter (FIG. 34).

FIG. 41 illustrates a schematic block diagram of the data deformatter924. The data deformatter 924 includes a dual stage memory 928, anoutput section 930, a write address generation unit 932, a read addressgeneration unit 934, and two mutliplexers, 936 938. The dual stagememory 928 includes a first memory stage 940 and a second memory stage942. The output section 930 includes an adder 944 and an AND gate 946.

In operation, the ordered data stream 808 is written into either thefirst stage 940 or the second stage 942 during a frame cycle. On thenext frame cycle, the ordered data stream 808 is written into the otherstage and read out of the previous stage. This is accomplished via theread-write signal 950 which may be supplied by a controller of a primarysite or secondary site. During a first frame cycle, the read-writesignal is a logic "1" such that the first stage 940 is in a write modeand the second section 942 is in the read mode. The read-write signal950 is also applied to MUX 936 and MUX 938 which controls the MUXes toprovide the appropriate addresses to the first and second stages 940 and942. For example, when the read-write signal is logic "1", MUX 938provides the write addresses to the first stage and MUX 936 provides theread addresses to the second stage. On the next frame cycle, theread-write signal is a logic "0" such that the first and second stagesswitch modes, and MUX 938 and MUX 936 provide the appropriate addresses.

When in a write mode, the write AGU 932 provides the addressinginformation to the particular stage of the dual stage memory 928. Duringthe read stage, the read AGU 934 provides the address information to theappropriate stage of the dual stage memory 928. Note that the dual stagememory 928 may be a Manchester encoder. The write address generationunit 932 may employ a circular buffer addressing scheme such that thedata of the ordered data stream is stored in a serial fashion. The readAGU 934 may employ a unique addressing scheme that utilizes the addresspointer information 952 to read out data blocks such that the recovereddata stream 926 may be reconstructed. Note that adder 944 may be asumming node, or just a direct coupling into the AND gate.

FIG. 42 illustrates a schematic block diagram of an alternate DMTreceiver. As shown, the DMT receiver includes an ADSL receiver 954 and adata deformatter 924. The ADSL receiver 954 includes a DMT decoder 962,a constellation decoder 964, a fast path 966, a de-interleave path 968,and a DEMUX 970. In addition, the ADSL receiver 954 includes a firstinput port 974, which allows bit loading information 816 to be directlywritten into a bit loading table 972. Further, the ADSL receiverincludes an output port 976, which allows the output of theconstellation decoder 964 to be directly outputted to the datadeformatter 924.

In general, the ADSL receiver 954 receives a time domain DMT symbol 876via the DMT decoder 962. The DMT decoder 962 converts the DMT symbol 876into a demodulated data stream 922. The constellation decoder 964converts this data stream 922 into an ordered data stream 808. Theordered data stream is outputted via the output port 976 to the datadeformatter 924. The data deformatter, which includes memory 956, an AGU958, and an output section 960, produces the recovered data stream 926.This may be accomplished by reading the ordered data stream under afirst addressing scheme during a first frame cycle, and then reading thestored data out under a second addressing scheme to produce therecovered data stream 926. Note that the data deformatter 924 isperforming the inverse function of the data formatter 806 (of FIGS.34-39) to recover the data that was supplied to the data formatter.

FIG. 43 illustrates an ADSL receiver 954 coupled to an ADSL datainterface 981. The ADSL data interface 981 includes the data deformatter924, a processor 978, memory 982, and a constellation decoder simulator980. The processor 978 provides the control signals to the datadeformatter such that the data deformatter 924 can convert the ordereddata stream 808 into the recovered data stream 926. In particular, theprocessor 978 generates the address pointer information, the enablesignal, and the rewrite signal. Recall that the read-write signal istoggled for every frame cycle. Such that for a first frame cycle, onestage of memory within the data deformatter is writing information whilethe second stage is reading and in the next frame cycle the first stageis reading data while the second stage is writing data.

The constellation decoder simulator 980 simulates the manner in whichthe constellation decoder and the ADSL receiver extract data from theDMT symbol 876 that it receives. As mentioned, data will be extracted inthe opposite manner in which it was encoded. Thus, the first data outwill be the data contained within the carrier channels having thelargest bit loading. Thus, the constellation decoder simulator 980simulates that process such that appropriate information can be providedto the data deformatter to accurately recover the data stream. Note thatthe constellation decoder simulator 980 may be incorporated in theprocessor 978. In essence, the processor 978 performs the functions togenerate the carrier channel allocation data base, the address pointerinformation, call type to bit loading requirement information, and bitloading information.

FIG. 44 illustrates a logic diagram that may be used to implement a DMTreceiver. At step 984, a time domain DMT symbol is received. At step986, the time domain DMT symbol is demodulated to produce a demodulateddata stream. At step 988, bit loading information and address pointerinformation is received. This information may be received from acontroller of a primary site or second site, or maybe intenallygenerated within an ADSL interface unit.

Having obtained the appropriate information, the process proceeds tostep 990 where an ordered data stream is generated from the demodulateddata stream. As previously mentioned, this is performed by aconstellation decoder with an ADSL receiver. Having generated thedemodulated data stream, the process proceeds to step 992 where arecovered data stream is produced from the ordered data stream based onthe bit loading information and address pointer information. This may beaccomplished by writing the ordered data stream into memory in a serialfashion and reading it out in a fragmented fashion based on the bitloading information and address pointer information.

FIG. 45 illustrates an alternative logic diagram that may be used tosimulate a DMT receiver. At step 984, bit loading information isobtained. Bit loading information may be obtained by receiving it from acontroller of a primary site or second site. Alternatively, the bitloading information may be obtained by querying a plurality of secondarysites to obtain site bit loading information and generating a call bitloading table from the appropriate site bit loading tables.

At step 966, a constellation decoder function of an ADSL receiver issimulated to produce a simulated decoded order of carrier channels. Thissimulated function may be performed based on the manner in which data isread from the carrier channels. Typically, this will be the inversefunction of the ADSL constellation encoder such that the carrierchannels having the largest bit loading will be encoded first andsubsequently read first.

Having produced the simulated decoded order of carrier channels, whichmay be contained in an ordered bit loading table, carrier channelallocation information is obtained, which is depicted at step 998. Thecarrier channel allocation information may be received from a controllerof a primary site or secondary site, or may be generated by a processorof an ADSL data interface unit.

Having obtained the appropriate information, the process proceeds tostep 1000 where a recovered data stream is produced from the ordereddata stream based on the carrier channel allocation information.

FIG. 46 illustrates a logic diagram that may be used to generate anaddress pointer for either the DMT receiver or the DMT transmitter. Atstep 1002, a data stream is stored in a serial order during a firstframe cycle. Next, at step 1004, during a second frame cycle, theprocess determines a number of bits for a first data block of the storeddata. For example, if the data stored contains three data entries,wherein each of the data entries include three data blocks, step 1004 isdirected towards the first data block of the first data entry. Next, theprocess proceeds to step 1006 wherein during the second frame cycle, theprocess determines an address pointer for the first data block. Theaddress pointer for the first data block will typically be the first, orinitial, address within the memory storing the data.

Next, the process proceeds to step 1008 and reads the bits of the firstdata block during a number of clock cycles, wherein the number of clockcycles corresponds to the number of bits within the first block. Forexample, assume that the first data block contains 11 bits, thus, thefirst 11 clock cycles of the second frame cycle will be dedicated toreading the 11 bits of data from the first data block.

At step 1010, the above steps are repeated for the remaining data blocksof each of the data entries. Thus, assume that the second data block ofthe first data entry also contains 11 bits and has an address pointer of11. Thus, during the twelfth through twenty-second clock cycle of thesecond frame cycle, the data will be read from the second data block.Having read all of the data in this manner, the ordered bit stream isgenerated as shown in step 1012.

FIG. 47 illustrates a logic diagram that may be used to generate addresspointer information as utilized by both the DMT receiver and the DMTtransmitter. At step 1014, a number of bits contained within a firstdata block of a data entry, which is to be stored, is determined duringa first frame cycle. For example, if the data to be stored is a datastream which has three data entries wherein the first data entry hasthree data blocks, step 1014 is determining the number of bits in thefirst data block of the first data entry.

Having done this, the process proceeds to step 1016 where an addresspointer is determined for the first data block during the first framecycle. Note that the first frame cycle is the time that corresponds towhen one frame of information is being transmitted. In an ADSL system,this equates to 250 microseconds. The address pointer for the first datablock typically will be the first address within the receiver ortransmitter memory section.

The process proceeds to step 1018 where the process stores the bits ofthe first data block during a number of clock cycles, wherein the numberof clock cycles equate to the number of bits of the first data block.This occurs during the first framing cycle. For example, assume that thefirst data block contains 11 bits. Thus, the first 11 clock cycles ofthe first frame cycle will be dedicated to storing the data of the firstdata block.

In step 1020, the preceding steps, 1014-1018, are repeated for theremaining data blocks of the data to be stored. Thus, the second datablock of the first data entry will have an address pointer determinedfor it, then the second data block is stored in memory during the numberof clock cycles equal to the number of bits in the second data entry.Once all the data is stored, the process proceeds to step 1022 wherein,during a second frame cycle, the data is read out in a serial order toproduce the recapture data stream. Thus, this particular logic diagramstores the data in the recovered data stream manner based on the addresspointer information and bit loading information and then reads it out ina serial, or a circular buffer, manner.

FIG. 48 illustrates an alternative logic diagram for generating addresspointer information for use by a DMT receiver or a DMT transmitter. Atstep 1024, a number of data blocks for a first transmit data entry isdetermined from the carrier channel allocation data base. Next, theprocess moves to step 1026, wherein the number of bits for each datablock for the first transmit data entry is obtained. Note that atransmit data entry may be a call, such as the transmission of videodata, audio data, a data file, a one-way RF communication, or a two-wayRF communication.

Having obtained this information, the process proceeds to step 1028,wherein for a first data block of the first transmit data entry, anaddress pointer is assigned to be the initial address of the writesection of the dual stage memory, or Manchester encoder. If the dualstage memory is used exclusively for the data formatter or datadeformatter, the initial address of the write section will typically bethe first address of the write section. Note that during a first framecycle, the first stage of the dual stage memory is the write section andduring a second frame cycle, the second stage is the write section.

Having assigned an address pointer to the first data block of the firsttransmit data entry, the process proceeds to step 1030, where adetermination is made as to whether the first transmit data entry hasmore than one data block. If yes, the process proceeds to step 1032,where an address pointer for the next data block of the first data entryis determined by adding the number of bits for the previous data blockto the address pointer of the previous data block. For example, if thefirst data block had an address pointer of zero and contained 11 bits,the address pointer for the second data block would be 11 (number ofbits of the preceding data block) plus zero (address pointer of thepreceding data block) which equals an address pointer for the seconddata block of 11.

Having determined the next address pointer, the process proceeds to step1034 where a determination is made as to whether all of the data blocksof the transmit data entry has been assigned an address pointer. If not,the process reverts back to 1032 wherein the address pointer for thenext data block is generated by adding the number of bits for theprevious data block to the address pointer of the previous data block.This process continues until all of the data blocks for the transmitdata entry have an address pointer. Once this occurs, the processreverts back to step 1038.

If the inquiry into whether the first transmit data entry has more thanone data block produces a negative response, the process proceeds tostep 1036. At step 1036, a decision is made as to whether anothertransmit data entry exists or whether one has recently been added. Ifeither of these inquiries are answered positively, the process proceedsto step 1044. At step 1044, an address pointer for a first data block ofthe new transmit data entry is calculated by adding the address pointerof the last data block to the number of bits of the last data block ofthe immediately proceeding transmit data entry. Having done this, theprocess proceeds to step 1044 where a determine is made as to whetherthe new transmit data entry has more than one data block. If the inquiryproduces a negative response, the process repeats at step 1038. If,however, the inquiry produces a positive response, the process revertsto step 1032 wherein the remaining data blocks of the transmit dataentry are assigned address pointers.

When the inquiry to step 1036 is negative, the process proceeds to step1038 where the process determines whether a transmit data entry has beenremoved. If not, the process waits for either a new transmit data entryto be added or one to be removed.

Upon detecting the removal of a transmit data entry, the processproceeds to step 1040 where the address pointer for each data block ofthe deleted transmit entry is deleted from the carrier channelallocation database. When this is completed, the process proceeds tostep 1042 wherein, for each transmit data entry subsequent to thedeleted transmit data entry, the address pointers for the data blocks ofthe subsequent transmit data entries are recalculated.

The address pointers for data blocks of transmit data entries that occursubsequent in the data stream to the deleted transmit data entry need tobe recalculated because the data blocks will not be stored in a similarplace as they were prior to the deletion. The recalculation process willproceed identical to step 1030 as if the removed or deleted transmitdata entry had never occurred for each of the subsequent transmit dataentries.

FIG. 49 illustrates a logic diagram that may be used to read the datafrom the memory in the DMT transmitter or used to store the data in aDMT receiver. At step 1048, the process begins by setting an initialread address equal to the initial address in the Manchester encoder, ordual stage memory, upon receipt of an enable signal. Having done this,the process proceeds to step 1050 wherein a number of bits for a firstdata block is retrieved from the carrier channel allocation table ordatabase. Next, the process proceeds to step 1052 wherein a block countis set to one.

At 1054, at a clock cycle, a first entry of the first data block isread. In other words, the first bit, or first byte, of the first datablock is read. This occurs on a clock cycle by clock cycle basis. Havingread the data, the process proceeds to step 1056 wherein the address andthe block count are incremented by one.

At step 1058, a determination is made as to whether the newlyincremented block count equals the number of bits for the data blockbeing read. If not, the process proceeds to step 1060 wherein, at asubsequent clock cycle, the next entry, or bit, in the data block isread. Having done this, the address and block count are incremented byone and a subsequent determination is made at step 1058.

When the block count equals the number of bits of the data block, theprocess proceeds to step 1062 where a determination is made as towhether all of the data blocks have been read. If all the data blockshave been read, the process is complete for this frame cycle. If not,the process proceeds to step 1064 by retrieving the address pointer andnumber of bits for the next data block. Having retrieved thisinformation, the process reverts to step 1052 and follows the logic flowas previously described.

FIG. 50 illustrates a logic diagram which may be utilized by the DMTreceiver to generate an address pointer. At step 1062, for a first datablock allocated to the first carrier channel allocation entry of thecarrier channel allocation table, or database, an address pointer isassigned to be the initial address of the write section of theManchester encoder, or dual stage memory. As mentioned with the previousfigure, the write section is the first stage of the dual stage memoryduring the first frame cycle and the second stage during the secondframe cycle. Next, the process proceeds to step 1064 where adetermination is made as to whether there is another carrier channelallocation entry in the carrier channel allocation table. If not, theprocess proceeds to step 1066 where a determination is made as towhether a change occurs in the carrier channel allocation table. If not,the process waits at step 1066 for a change in the carrier channelallocation table to occur.

Once the carrier channel allocation table has changed, the processreverts back to step 1062 wherein all of the carrier channel allocationentries receive a new address pointer, starting with the first carrierchannel allocation entry, which corresponds to the first data block, inthe carrier channel allocation table.

If the answer to step 1064 is yes, the process proceeds to step 1068where an address pointer is determined for the next data block, or nextcarrier channel allocation entry, by adding the number of bits for theprevious data block to the address pointer of the previous data block.Thus, if the previous data block had 10 bits and its address pointer ofthe previous data block was 20, the address pointer for the new datablock, or carrier channel allocation entry, would be 30. Having madethis calculation, the process reverts back to 1064.

FIGS. 51-61 illustrate examples of the operation of the presentinvention. FIG. 51 illustrates a data stream 1070, which includes aplurality of frames. Frame (n+1) 1072 is shown in greater detail toinclude a plurality of data entries. As shown, the first data entrycontains outbound control channel information, a second data entryincludes a first data call, a third data entry includes a second datacall, and a fourth data entry includes a third data call. The actualinformation contained within the frame 1072 is a data stream as depictedin 1074.

As previously described, when a data entry cannot be supported by asingle carrier channel, the data entry is broken down into data blocks,wherein a data block is allocated to a particular carrier channel. Asshown, the partitioning of the data entry into data blocks equates datablocks of the third data call to particular carrier channels. As isknown in the ADSL art, a carrier channel can be represented as a vector1076, wherein the magnitude and phase of the vector is based on the datawhich the carrier channel is carrying and the bit loading of the carrierchannel. The bit loading of a carrier channel indicates the number ofconstellation points, i.e., the number of magnitude and phasecombinations for the vector. For example, if the bit loading of acarrier channel is 2, the number of constellation points is 4 (2²) whichcan be equated to a binary numbering system. Thus one constellationpoint equates to the binary number 00, a second point to binary number01, etc. From this, one skilled in the art will readily appreciate howthe bit loading of a carrier channel equates to the number of bits thecarrier channel can support, or carry.

FIG. 51 further illustrates three carrier channels shown as a vector1072, each representing a particular data block of the third data call.Thus, the data block on the far left of the data entry equates to thecarrier channel vector on the far left. The second data block equates tothe second carrier channel vector and the third data block equates tothe third carrier channel vector. Each of these carrier channel vectorsmay be used to produce a particular quadrature amplitude modulated (QAM)signal 1078 at a given frequency. As previously mentioned, the ADSLsystem incorporates 256 carrier channels, beginning at 25 kilohertz upto 1.1 MHz at increments of 4 kilohertz.

The final illustration of FIG. 51 is a time domain DMT symbol 1080. Asmentioned, the ADSL transmitter includes a DMT modulator. The DMTmodulator takes the digital representations of the constellationencoding 1076, or the vector representations of the carrier channels,and produces the time domain DMT symbol 1080. In essence, the timedomain DMT signal is the summation of the carrier channels 1078 toproduce the resultant DMT symbol. Note that the DMT symbol 1080 isdepicted for one frame. Thus for each frame, a new DMT symbol isgenerated in a like fashion.

FIG. 52 illustrates memory 1082, which may be incorporated in thecontroller's memory of the primary site, in the controller's memory ofthe secondary site, or in an ADSL data interface unit. The memory, asshown, stores a plurality of site outbound bit loading tables 1084,wherein each of the site outbound bit loading tables contains a channelfield and a corresponding bit loading field. Thus, as shown, carrierchannel zero has a bit loading of 13 bits, carrier channel 1 has a bitloading of 14 bits, etc.. The memory further stores a plurality of siteinbound bit loading tables 1086. The site inbound bit loading tables arebased on an inbound transmission path wherein the site outbound bitloading tables 1084 are based on an outbound transmission path.

The memory 1082 further stores a bit rate data base 1096. The bit ratedata base includes a call type field, a data rate field, and a bitrequirement field. For example, the first entry is an audio type 1,which has a bit rate requirement of 8 Kbps. For the ADSL system, thistranslates to a 2 bit per frame requirement. Recall that the frame rateof the ADSL system is 4 KHz, thus the bits per frame requirement is theresult of the bit rate requirement divided by the 4 KHz rate.

The memory 1082 further stores an inbound carrier channel requirementtable 1094. This table indicates for each call the number of inboundchannels in use. Although not shown, the memory also includes anoutbound carrier channel requirement table which stores the number ofoutbound carrier channels used for a particular call. In addition, thisinformation is used to generate the carrier channel allocation database.

Memory 1082 further stores the current call lowest common denominatorbit loading tables 1092. For example, one current call bit table is anoutbound control channel bit loading table which is shown to havecarrier channel zero having 11 bits, carrier channel one having 11 bits,carrier channel two has 10 bits, etc. The creation of a call bit loadingtable was previously described to be a compilation of a set of siteoutbound bit loading tables for the outbound transmission path and acompilation of a set of site inbound bit loading tables for an inboundtransmission path.

The next portion of memory 1082 includes a geographical call assignmentdatabase 1090. This call assignment database includes, for each call,the sites that are supporting the call. Recall that a site is supportinga call with a targeted subscriber is affiliated with the site.

The memory 1082 also stores an outbound carrier channel allocation table1088 and an inbound carrier channel allocation table (not shown). Theinbound and outbound channel allocation tables contain the same fields,i.e. a carrier channel field, a bit loading field, an allocation field,and an address pointer field. The outbound carrier channel allocationtable 1088 shows that the first carrier channel has 11 bits, isallocated to the first data block of outbound control, and has anaddress pointer of zero. The second carrier channel has 11 bits, isallocated to the second data block of the outbound control channel, andhas an address pointer of 11. The data for the remaining carrierchannels has similar type data. From these tables, the controller thathas access to them can perform any of the functions previouslydescribed.

To further illustrate the operation of the present invention, refer toFIG. 53 which illustrates, for a 10 carrier channel system that includessix sites, a plurality of site bit loading tables. The site bit loadingtables are generated by transmitting a training signal to the respectivesite over a particular transmission path, i.e., the inbound path or theoutbound path, and determining a spectral response of the transmissionpath based on the training signal. Thus, the site bit loading for site1, 1098, has the 10 carrier channels and their corresponding bitloading. For example, carrier channel zero has a bit loading of 10 bits,carrier channel 1 has a bit loading of 11 bits, etc. The site bitloading tables for sites 2-6 1100-1108 are shown to include a variety ofbit loadings for the corresponding carrier channels.

From the plurality of site bit loading tables shown in FIG. 53, acontrol channel bit loading table 1110, as shown in FIG. 54, may begenerated. The generation of this table requires both FIG. 53 and FIG.54 to be reviewed simultaneously. To create a control channel bitloading table, each of the site bit loading tables needs to be comparedsimultaneously on a carrier channel by carrier channel basis. Forcarrier channel zero, the bit loading in each of the site bit loadingtables 1098-1108 is compared to identify the lowest bit loading.Reviewing, for carrier channel zero, the bit loading in site 1 is 10bits, in site 2 it's 11, in site 3 it's 12, in site 4 it's 11, in site 5it's 15, in site 6 it's 15. Thus, the lowest bit loading for carrierchannel zero appears in the site bit loading table 1098 for site 1. Thisvalue is stored in the control channel LCD bit table or control channelbit loading table 1110 for carrier channel zero. A similar comparison isdone for the remaining channels.

Having generated the LCD bit loading table, the table is ordered basedon the constellation encoding function used within the DMT transmitter.The exemplary constellation encoding function depicted is a largest bitloading carrier channel to smallest bit loading carrier channel. Thus,the ordered bit loading table 1112 has the carrier channels arranged bytheir bit loading. The first entry in the ordered bit loading table iscarrier channel 1, which has 11 bits, then carrier channel 2, which alsohas 11 bits, then carrier channel 3, which also has 11 bits, and so on.The ordered bit loading table is achieved by scanning the LCD bit table1110 from a top-down fashion. Thus, the first largest bit loading is thefirst entry in the bit loading table. The ordered bit loading continuesby scanning the bit loading table and even if it finds a bit loadingthat matches a carrier channel, it would be a subsequent entry in theordered bit loading table. For example, as shown, carrier channels 1, 2and 3 all have a bit loading of 11 bits. But, from the scan, carrierchannel 1 is detected first followed by carrier channel 2, then carrierchannel 3. The remaining order of the carrier channels is followed in asimilar manner.

Having created the ordered bit loading table 1112, the bit requirementsfor the control channel is determined. For this example, it wasdetermined that 22 bits per frame were required. Thus, utilizing thechannel allocation procedures described herein, the ordered bit loadingtable is scanned from a top-down approach. The first inquiry is whetherthe required number of bits exceeds the maximum bit loading of the firstentry in the ordered bit table. In this case, the number of requiredbits is 22, which exceeds the 11 bits of carrier channel 1. Thus, inthis case, the first carrier channel is allocated to a first portion, orfirst data block of the data entry designated as the outbound controlchannel. Next, a remaining number of bits is calculated by subtractingthe bit loading for carrier channel one from the number of requiredbits. Thus, for this example, that equation is 22-11, which yields 11remaining bits.

The 11 remaining bits are then used to scan the ordered bit loadingtable, less the first carrier channel which has already been allocated.Thus, the scanning determines that the remaining number of required bitsdoes not exceed the maximum bit loading of a carrier channel within theordered bit loading table. Having made this decision, the processdetermines whether a match occurs between a bit loading of a particularcarrier channel and the remaining number of required bits. As shown,carrier channel 2 has a bit loading of 11 bits which matches theremaining number of required bits, which is the first match found in atop-down scan. Therefore, carrier channel 2 is allocated to the seconddata block of the data entry designated outbound control channel.

Having made these allocations, address pointers are determined based onthe manner in which the data will be stored within the write section ofthe dual stage memory. Because the outbound control channel is the firstdata entry, the first data block of the outbound control channel willhave an address pointer of zero. The second data block of the outboundcontrol channel will have its address pointer at 11. This is calculatedby adding the address pointer of the first data block to the number ofbits in the first data block. In this case, the address pointer is zeroplus 11 (the number of bits) thus providing the address pointer of 11.

Having determined this information, the carrier channel allocation table1114 is generated showing the carrier channels in the ordered bitloading fashion. The table includes the number of corresponding bits,the allocation to the particular data block, address pointerinformation, and bit reduction information. The bit reductioninformation will be discussed below.

FIG. 55 illustrates an example of when a first data call is added to thedata being transmitted. For this call, assume that 8 bits are requiredand only sites 5 and 6 are supporting this particular call. Given thisinformation, an LCD call bit loading table 1116 is generated from thesite bit loading tables 1006 and 1008. As shown in FIG. 53, the bitloading for channel zero in site 5 is 15 and the bit loading for channelzero in site 6 is 15. Thus, the lowest bit loading between these twosites is 15, which is the value entered into the table 1116. The bitloading for carrier channel 1 of site 5 is 15 bits and the bit loadingfor carrier channel 1 of site 6 is 14 bits. Fourteen, being the lesserof the two values, is entered into the bit loading table 1116 and theprocess continues for each of the carrier channels in sites 5 and 6 tocreate a completed LCD bit loading table 1116. In addition to generatingthe table, allocation information is added as an addendum to the calltable, indicating that carrier channels one and two are alreadyallocated to the outbound control channel. Thus, when generating theordered bit table of available carrier channels, carrier channel 1 and 2are omitted from table 1120.

Having generated the order bit loading table 1120, the carrier channelallocation process first determines whether the bit requirements isgreater than the maximum number of bits available in a given carrierchannel. In this case, the bit requirements are 8 bits, while themaximum bit loading for a carrier channel is 15 bits. Thus, the answerto this inquiry is negative such that the next step is to find a carrierchannel that has a bit loading which matches the bit requirements. Inthis case, the match occurs 1118 at carrier channel 7, which has a bitloading of 8 bits.

Having identified carrier channel 7 as the appropriate carrier channel,the carrier channel allocation table 1122 is updated to include theallocation of carrier channel 7 to data call 1. The updated carrierchannel allocation table 1122 indicates that carrier channel 7 has 8bits, is allocated to call 1, has an address pointer of 22, and has zerobit reductions. The address pointer is generated by realizing that thedata block for call 1 will follow the second data block of the outboundcontrol channel in the data stream being transmitted to the dataformatter. Thus, the address pointer for call 1 is determined by addingthe address pointer for the second data block of the outbound controlchannel, which is 11, to the number of bits for that data block, whichis also 11. Thus producing the address pointer 22. Note that theremaining carrier channels have been reduced to 2 bits and have not beenallocated. Thus they will be filled with null information. Note that asan alternative, the remaining bits that are not allocated to a call maybe assigned a bit loading of zero bits, thus no information will betransmitted other than the information corresponding to a data entry.

FIG. 56 illustrates when a second data call is added to the system whilethe first call is still active. Assume that the bit requirement for thesecond data call is 16 bits and that the sites 1, 2 and 3 are supportingthe second data call. Given this information, an LCD bit loading tablefor call 2 is generated 1126. In addition, the carrier channels thathave already been allocated to a particular call are flagged, such that,when the ordered bit loading table 1132 is created, it is created usingonly available carrier channels.

To allocate carrier channels to the second data call, the process firstdetermines whether the bit requirements exceed the maximum bit loadingof the first carrier channel entry in the ordered bit loading table1132. In this case, the bit requirements are 16 while the maximum bitloading for a carrier channel is 11. Thus, the first carrier channelwill be allocated to the call which is carrier channel 3, and aremaining number of bits is determined. In this case remaining number ofbits is 16 minus 11 which equals 5. Having done this, the process looksfor a remainder match 1130 which is found in carrier channel 9. Havingmade the carrier channel allocations as described in 1128 and 1130, thecarrier channel allocation table 1134 is updated to include theallocations for data call two.

FIG. 56 also illustrates a formatted data stream 1136 or an ordered datastream 1136. The ordered data stream 1136 is based upon the carrierchannel bit loading table wherein the first entry in the table is thefirst data block of the formatted data base followed by the second datablock and so on. Note that the address pointer information for call 2Aand call 2B are also included in the carrier channel allocation table1134. The address pointer for call 2A is determined by adding theaddress pointer of the previous data block, in this case call 1, to thenumber of bits in the previous data block. In this case, the previousaddress was 22 and the number of bits in the previous block is 8. Thus,the address pointer for call 2A is 30. The address pointer for call 2Bis calculated in a similar manner.

FIG. 57 illustrates the situation when a third call is added to thesystem with calls 1 and 2 still being active. In this case, it isassumed that the bit requirements for call 3 is 32 bits and sites 1-5are involved in the call. An LCD bit loading table and in-use table forcall 3 is generated 1138. The LCD bit loading portion is based upon thesite bit loading tables 1098-1106. Once the bit loading table isgenerated for this particular call, an ordered bit loading table ofavailable carrier channels 1150 is generated. From the ordered bitloading table 1150, carrier channels are allocated based upon the bitrequirements. At 1140, the first available carrier channel is allocatedto the call. Having allocated carrier channel zero to this call, aremaining bit value is calculated. For this case, the remaining bitvalue is 32 minus 10 which equals 22. At 1142, due to the remainingnumber of required bits being greater than the maximum bit loading of acarrier channel, the next available carrier channel is allocated to thecall. In this case, carrier channel 4, which has a bit loading of 10, isallocated to data call 3.

Having made two data block allocations to call 3 a remaining number ofbits is again calculated. In this case, the remaining number of bits is22 minus 10 which equals 12. Again, the remaining number of bits exceedsthe maximum bit loading of the remaining channels in the ordered bitloading table 1150 thus, at 1144, the next available channel isallocated. In this case, carrier channel 5, which has a bit loading of8, is allocated the third data block of call 3.

Given the three data block allocations, a remaining number of requiredbits is subsequently determined. The previous number of required bitswas 12, subtracting the bit loading of carrier channel 5, which is 8bits, leaves a remainder of 4 bits. At this stage, remaining carrierchannels have bit loading in excess of the remainder number of bits.Thus, the process looks for an exact match, which does not occur in thiscase. Without an exact match, the process then looks for a closestmatch. In this case, at 1146, an overflow assignment is created byallocating carrier channel 8, which has a bit loading of 8 bits, to thedata call. In this case however, only 4 bits are required. Thus, the bitloading for carrier channel 8 is reduced to 4 bits. This is shown as1148. Thus, by allocating 4 data blocks to data call 3, the bitrequirements of the call can be met. Having made these carrier channelallocations, the carrier channel allocation bit loading table 1152 isupdated to reflect the changes in the call assignments and the addresspointer information. The ordered data stream or formatted data stream isdepicted as 1154.

FIG. 58 illustrates call 2 ending while call 1 and call 3 are stillactive. Given these parameters, the carrier channel allocation table andaddress pointer information are updated in the carrier channelallocation table 1156. To update the allocation field, the allocation ofcarrier channels to call 2A and B are simply deleted. The updating ofthe address pointer information, however, is a little more difficult. Toupdate address pointer information, the address pointers for call 3 needto be recalculated. With the deletion of call 2, the first data block tobe received after the data block for call 1 will be data block 3A. Thus,the address pointer for 3A will be 30. Address pointers for theremaining data blocks of calls 3 will be calculated as previouslydescribed by adding the address pointer of the previous data block tothe number of bits of the previous data block.

Memory 1158 depicts how the data entries and their corresponding datablocks will be stored in the write section of the dual stage memory.Thus, the first data block will be stored at address 0, the second datablock at address 11, and so on.

FIG. 59 illustrates the process of updating the site bit loading tables.Recall that the site bit loading information is updated on a periodicbasis within ADSL system or DMT system. This is required because thetransfer function of the transmission paths regularly change due toweather variations. A comparison of the updated bit loading table forsite 1 1160 and the site bit loading table 1098 in FIG. 53 shows thatcarrier channel 0 has increased its bit loading capabilities from 10bits to 12 bits, carrier channel 1 has increased its bit loadingcapabilities from 11 bits to 12 bits, etc. A similar comparison may bemade for site 2, 3, 4, 5, and 6. Given the updated site bit loadingtable, the call bit loading tables for current calls must be updated todetermine whether the current carrier channel allocations providesufficient band width for the types of calls being supported.

FIG. 60 illustrates an updated control channel bit loading table. Asshown, the new control channel bit loading table 1172 indicates the bitloading capabilities for each channel. Note that carrier channels 1 and2 now have 12 bit capacity, respectively. In the previous carrierchannel allocation they each had 11 bits. Thus, carrier channels 1 and 2will still provide the required band width requirements for the controlchannel. Thus, even though the bit loading capabilities have increase,the bit loading table for these will be reduced by one bit such thatcarrier channel 1 and carrier channel 2 remain at 11 bits each. Thiswill be reflected in the carrier channel allocation table and eachcarrier channel will have a bit reduction of 1 bit.

FIG. 60 also illustrates the updated call bit loading table for call 3.Having generated this table the ordered bit loading table 1178 isgenerated and a determination is made as to whether the previouslyallocated channels provide a sufficient number of bits. As shown, thebits for the allocated carrier channels equals 39 which exceeds the 32bit requirement. Thus, the updated bit loading for these carrierchannels will provide adequate bandwidth and will be reduced to theprevious values to maintain performance as achieved prior to the update.

FIG. 61 illustrates the updated call bit loading table 1180 for call 1.The figure also illustrates the updated ordered bit loading table 1182for call 1. Note that the bit loading for carrier channel 7 has beenreduced to seven bits. The seven bits is less than the required eightbits; thus, carrier channel 7 can no longer support call 1. Given this,the available channels in the ordered bit loading table are scanned todetermine if another carrier channel can support the call. In this case,carrier channel 6 which has a bit loading of nine bits has the closestmatch. Therefore, carrier channel 6 is allocated to call 1 and theinformation is updated in the carrier channel allocation table 1184.Note that the bit reduction is also updated in the table.

The present invention provides a communication system infrastructurethat utilizes DMT technology and twisted pairs as the interconnectionmedium. With such an apparatus and method, communication systeminfrastructure may be placed in areas where it was not achievablebefore. Typically, communication infrastructure required high data ratetransmission infrastructure connections such as T1 links or microwavelinks. These high data rate transmission path requirements areeliminated by the present invention, thereby expanding the usefulnessand areas in which communication systems may be established.

What is claimed is:
 1. A discrete multi-tone receiver comprising:adiscrete multi-tone decoder that receives a time domain discretemulti-tone symbol and produces an ordered data stream based on bitloading information at an output; a fast path having an input coupled tothe output of the discrete multi-tone decoder, and an output; ade-interleave path having an input coupled to the output of the discretemulti-tone decoder, and an output; a de-multiplexer having a first inputcoupled to the output of the fast path, and a second input coupled tothe output of the de-interleave path; and a data de-formatter having aninput directly coupled to the output of the discrete multi-tone decoder,wherein the data de-formatter receives the ordered data stream andproduces a recovered data stream based on carrier channel allocationinformation.
 2. The discrete multi-tone receiver of claim 1, wherein thedata de-formatter further comprises:a dual stage memory, wherein, duringa first frame cycle, a first stage of the dual stage memory is storingthe ordered data stream and a second stage of the dual stage memory isproviding a first portion of the recovered data stream, and wherein,during a second frame cycle, the first stage is providing a secondportion of the recovered data stream and the second stage is storing theordered data stream; a write address generation unit operably coupled tothe dual stage memory, wherein the write address generation unitprovides write addresses to the first stage during the first frame cycleand provides the write addresses to the second stage during the secondframe cycle; and a read address generation unit operably coupled to thedual stage memory, wherein the read address generation unit generatesread addresses based on address pointer information, and wherein theread address generation unit provides the read addresses to the secondstage during the first frame cycle and provides the read addresses tothe first stage during the second frame cycle.
 3. The discretemulti-tone receiver of claim 1, wherein the data de-formatter furthercomprises:a dual stage memory, wherein, during a first frame cycle, afirst stage of the dual stage memory is storing the ordered data streamand a second stage of the dual stage memory is providing the recovereddata stream, and wherein, during a second frame cycle, the first stageis providing the ordered data stream and the second stage is storing theordered data stream; a read address generation unit operably coupled tothe dual stage memory, wherein the read address generation unit providesread addresses to the second stage during the first frame cycle andprovides the read addresses to the first stage during the second framecycle; and a write address generation unit operably coupled to the dualstage memory, wherein the write address generation unit generates writeaddresses based on address pointer information, and wherein the writeaddress generation unit provides the write addresses to the first stageduring the first frame cycle and provides the write addresses to thesecond stage during the second frame cycle.
 4. The discrete multi-tonereceiver of claim 2, wherein the data de-formatter further comprises:anoutput section that is operably coupled to the first stage and thesecond stage, wherein, based on an enable signal, the output sectionoutputs the recovered data stream.
 5. The discrete multi-tone receiverof claim 2, wherein the data de-formatter further comprises:a firstmultiplexer that provides operable coupling between the dual stagememory and both the read address generation unit and the write addressgeneration unit, wherein the first multiplexer, based on a read/writesignal, provides the write addresses or the read addresses to the firststage; and a second multiplexer that provides operable coupling betweenthe dual stage memory and both the write address generation unit and theread address generation unit, wherein the second multiplexer, based onthe read/write signal, provides the read addresses or the writeaddresses to the second stage.
 6. The discrete multi-tone receiver ofclaim 4, wherein the output section comprises an adder that sums thefirst and second portions of the recovered data stream and an AND gatethat ands an output of the adder and the enable signal.
 7. A discretemulti-tone receiver comprising:an Asymmetrical Digital Subscriber Linkincluding:a constellation decoder that receives a demodulated datastream to produce an ordered data stream based on bit loadinginformation; and a bit loading table operably coupled to theconstellation decoder, wherein the bit loading table receives and storesthe bit loading information; and a data de-formatter operably coupled tothe Asymmetrical Digital Subscriber Link, wherein the data de-formatterincludes:memory that stores the ordered data stream based on a firstaddressing scheme to produce stored data and provides the stored databased on a second addressing scheme to produce a recovered data stream;and address generation unit operably coupled to the memory, wherein theaddress generation unit produces the first addressing scheme and thesecond addressing scheme; and an output section operably coupled to anoutput of the memory, wherein, based on an enable signal, the outputsection regulates the recovered data stream.
 8. A method for recoveringdata from a time domain discrete multi-tone symbol, the methodcomprising the steps of:a) receiving the time domain discrete multi-tonesymbol; b) demodulating the time domain discrete multi-tone symbol toproduce a demodulated data stream; c) receiving bit loading informationand address pointer information; d) generating an ordered data streamfrom the demodulated data stream; and e) producing a recovered datastream from the ordered data stream based on the bit loading informationand the address pointer information.
 9. The method of claim 8, whereinstep (e) further comprises:extracting data entry partitioninginformation from the address pointer information to produce a pluralityof data entry portions; and extracting an address pointer for each dataentry portion of the plurality of data entry portions from the addresspointer information to produce a plurality of address pointers.
 10. Themethod of claim 9, wherein step (e) further comprises:storing theordered data stream in a sequential order to produce stored data; andreading the stored data based on the data entry partitioning informationand the plurality of address pointers to produce the recovered datastream.
 11. A method for extracting data from a designated carrierchannel of an Asymmetrical Digital Subscriber Link receiver, the methodcomprising the steps of:a) obtaining bit loading information; b)simulating a constellation decoding function of the Asymmetrical DigitalSubscriber Link receiver to produce a simulated decoded order of carrierchannels; c) obtaining carrier channel allocation information for thedata, wherein the carrier channel allocation information indicates thatthe data includes at least one data block and identity of at least onecarrier channel of the simulated decoded order of carrier channelsallocated to the at least one data block; and d) producing a recovereddata stream of the data based on the carrier channel allocationinformation.
 12. The method of claim 11, wherein step (a) furthercomprises obtaining a call bit loading table that includes a compilationof a plurality of site bit loading tables as the bit loadinginformation.
 13. The method of claim 11, wherein step (a) furthercomprises obtaining a site bit loading table as the bit loadinginformation.
 14. The method of claim 11, wherein step (b) furthercomprises:arranging carrier channels of a plurality of carrier channelsbased on bit loading of each of the plurality of carrier channels andthe constellation decoding function to produce the simulated decodedorder of carrier channels.
 15. The method of claim 11 further comprisesobtaining address pointer information for the at least one data block.16. The method of claim 15, wherein step (d) further comprises:storingthe data based on a first addressing scheme during a first frame cycle;and reading the data based on a second addressing scheme during a secondframe cycle to produce the recovered data stream, wherein the secondaddressing scheme utilizes the address pointer information and thecarrier channel allocation information.
 17. An Asymmetrical DigitalSubscriber Link receiver comprising:a constellation decoder; a fast pathhaving an input coupled to an output of the constellation decoder, andan output; a de-interleave path having an input coupled to the output ofthe constellation decoder, and an output; a de-multiplexer having afirst input coupled to the output of the fast path, and a second inputcoupled to the output of the de-interleave path; a discrete multi-tonedemodulator having an output coupled to an input the constellationdecoder; a memory having an input coupled to an output of theconstellation decoder, wherein the memory stores bit loadinginformation; an output port coupled to the output of the constellationdecoder, wherein the output port provides a path for the constellationdecoder to directly output an ordered data stream; and an input portcoupled to the input of the memory, wherein the input port provides apath for the memory to receive the bit loading information from anexternal source.
 18. A data interface for receiving data from anAsymmetrical Digital Subscriber Link receiver, the data interfacecomprising:memory for storing bit loading information, carrier channelallocation information, and data bit loading requirements; constellationdecoder simulator that orders a plurality of carrier channels based on aconstellation decoding function to produce simulated decoded order ofcarrier channels; a processor operably coupled to the memory and theconstellation decoder simulator, wherein the processor extracts a datablock pattern from the carrier channel allocation information and thesimulated decoded order of carrier channels; and a data de-formatteroperably coupled to the processor, wherein the data de-formattergenerates a recovered data stream from an ordered data stream based onthe data block pattern.